Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ISAAC
2005
Springer

favoriteEmaildiscussreport

100views Algorithms» more ISAAC 2005»

Separability with Outliers

13 years 10 months ago

Separability with Outliers

Download graphics.stanford.edu

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 diﬀerent 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.

Sariel Har-Peled, Vladlen Koltun

Real-time Traffic

Approximate Algorithms | ISAAC 2005 | Optimal Separators | Various Extent Measures |

claim paper

Related Content

» A dynamic generating graphical model for pointsets matching

» A classmodular GLVQ ensemble with outlier learning for handwritten digit recognition

» Increasing Efficiency of SVM by Adaptively Penalizing Outliers

» Parameterless outlier detection in data streams

» Robust variable selection using least angle regression and elemental set sampling

» TwoStage Classification System combining ModelBased and Discriminative Approaches

» Background Compensation for PanTiltZoom Cameras Using 1D Feature Matching and Outlier Reje...

» Subspace outlier mining in large multimedia databases

» Linear Combination Representation for Outlier Detection in Motion Tracking

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Sariel Har-Peled, Vladlen Koltun

Comments (0)