Abstract
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to different classes of separators and various extent measures. This class of geometric problems generalizes two widely studied problem families, namely separability and the computation of statistical estimators. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Har-Peled, S., & Koltun, V. (2005). Separability with outliers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 28–39). https://doi.org/10.1007/11602613_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
