The following pages link to (Q5415303):
Displaying 11 items.
- Optimization approaches to supervised classification (Q1753623) (← links)
- Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III (Q1816292) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- Spherical separation with infinitely far center (Q2156908) (← links)
- An illumination problem: optimal apex and optimal orientation for a cone of light (Q2250115) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- Support vector machine polyhedral separability in semisupervised learning (Q2342142) (← links)
- Clustering based polyhedral conic functions algorithm in classification (Q2514696) (← links)
- A Lagrangean relaxation approach to lifetime maximization of directional sensor networks (Q6087140) (← links)
- Ellipsoidal classification via semidefinite programming (Q6161915) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)