Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
Red-blue separability problems in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
| Hi-index | 0.04 |