Robust classification of dynamic bichromatic point sets in R^2
From MaRDI portal
Publication:7260652
Cites work
- Algorithms and Computation
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial complexity bounds for arrangements of curves and spheres
- Computational geometry. Algorithms and applications.
- Constructing many faces in arrangements of lines and segments
- scientific article; zbMATH DE number 7788577 (Why is no real title available?)
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Linear Programming in Linear Time When the Dimension Is Fixed
- Low-Dimensional Linear Programming with Violations
- Metric entropy of some classes of sets with differentiable boundaries
- Minimizing the error of linear separators on linearly inseparable data
- On geometric optimization with few violated constraints
- On the bichromatic k-set problem
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Optimal partition trees
- Support-vector networks
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The polynomial solvability of convex quadratic programming
This page was built for publication: Robust classification of dynamic bichromatic point sets in \(\mathbb{R}^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260652)
