Name
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 sepa- rated, with respect to dieren t 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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11602613_5 | International Symposium on Algorithms and Computation |
Keywords | Field | DocType |
geometric problem,point set,optimal separator,different class,statistical estimator,various extent measure,approximate algorithm,d-dimensional space,problem family | Applied mathematics,Discrete mathematics,Mathematical optimization,Computational geometry,Outlier,Geometric problems,Mathematics,Estimator,Computation | Conference |
Volume | ISSN | ISBN |
3827 | 0302-9743 | 3-540-30935-7 |
Citations | PageRank | References |
1 | 0.37 | 30 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sariel Har-Peled | 1 | 2630 | 191.68 |
| Vladlen Koltun | 2 | 4064 | 162.63 |