Analysis of incomplete data and an intrinsic-dimension Helly theorem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 464-473

  Gao, Jie ^a   Langberg, Michael ^b   Schulman, Leonard J ^b  

^a Stony Brook University   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALLS; HELLY THEOREM; INTERSECTION RADIUS;

ALGORITHMS; DATA STRUCTURES; GEOMETRY; PROBLEM SOLVING; STATISTICS;

THEOREM PROVING;

EID: 33244485007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109609     Document Type: Conference Paper

References (16)

1. P. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets. In Current Trends in Combinatorial and Computational Geometry. Cambridge University Press, 2005.
2. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM, 51(4): 606-635, 2004.
3. P. K. Agarwal and C. M. Procopiuc. Approximation algorithms for projective clustering. In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 538-547, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics.
4. P. K. Agarwal, C. M. Procopiuc, and K. R. Varadarajan. Approximation algorithms for k-line center. In ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, pages 54-63, London, UK, 2002. Springer-Verlag.
5. P. K. Agarwal, C. M. Procopiuc, and K. R. Varadarajan. A (1 + ε)-approximation algorithm for 2-line-center. Comput. Geom. Theory Appl., 26(2):119-128, 2003.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2003.
7. M. Bǎdoiu and K. L. Clarkson. Smaller core-sets for balls. In SODA '03: Proceedings of the fourteenth annual ACMSIAM symposium on Discrete algorithms, pages 801-802, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
8. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 250-257, New York, NY, USA, 2002. ACM Press.
9. S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In STOC '04: Proceedings of the thirtysixth annual ACM symposium on Theory of computing, pages 291-300, New York, NY, USA, 2004. ACM Press.
10. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry, pages 312-318, New York, NY, USA, 2002. ACM Press.
11. S. Har-Peled and Y Wang. Shape fitting with outliers. SIAM J. Computing, 33:269-285, 2003.
12. E. Helly. Über Mengen konvexer Körper mit gemeinschaftlichen Punkten. Jahresbericht Deutsch. Math. Verein., 32:175-176, 1923.
13. P. Kumar, J. S. B. Mitchell, and E. A. Yildirim. Approximate minimum enclosing balls in high dimensions using core-sets. J. Exp. Algorithmes, 8:1.1, 2003.
14. P. Kumar and E. A. Yildirim. Approximating minimum volume enclosing ellipsoids using core sets. J. Opt. Theo. Appl., 2004. to appear.
15. R. J. A. Little and D. B. Rubin. Statistical analysis with missing data. John Wiley & Sons, Inc., New York, NY, USA, 1986.
16. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica, 16:498-516, 1996.