Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897837zbMATH OpenOpenAlexFDO

Authors Sariel Har-Peled, Vladlen Koltun

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms for weak and wide separation of sets
• Red-blue separability problems in 3D
• Hyperplane separability and convexity of probabilistic point sets
• Hyperplane separability and convexity of probabilistic point sets
• Set separation problems and global optimization.

Cited in

(16)

• On the separability of stochastic geometric objects, with applications
• Optimal outlier removal in high-dimensional spaces
• Shortest paths in the plane with obstacle violations
• Hyperplane separability and convexity of probabilistic point sets
• Red-blue separability problems in 3D
• Hyperplane separability and convexity of probabilistic point sets
• On the separability of stochastic geometric objects, with applications
• Shortest paths in the plane with obstacle violations
• Computing shortest paths in the plane with removable obstacles
• Optimal outlier removal in high-dimensional
• RED-BLUE SEPARABILITY PROBLEMS IN 3D
• Algorithms for weak and wide separation of sets
• On two simple[st] learning tasks
• Robust bichromatic classification using two lines
• Robust classification of dynamic bichromatic point sets in \(\mathbb{R}^2\)
• How to get close to the median shape

This page was built for publication: Algorithms and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897837)