Separability with outliers

Sariel Har-Peled, Vladlen Koltun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings
Pages28-39
Number of pages12
DOIs
StatePublished - Dec 1 2005
Event16th International Symposium on Algorithms and Computation, ISAAC 2005 - Hainan, China
Duration: Dec 19 2005Dec 21 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3827 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Symposium on Algorithms and Computation, ISAAC 2005
Country/TerritoryChina
CityHainan
Period12/19/0512/21/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Separability with outliers'. Together they form a unique fingerprint.

Cite this