Smaller core-sets for balls

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 801-802

  Bǎdoiu, Mihai ^a   Clarkson, Kenneth L ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GRADIENT METHODS; PROBLEM SOLVING; THEOREM PROVING;

CORE-SETS; GRADIENT-DESCENT ALGORITHM;

APPROXIMATION THEORY;

EID: 0038415980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Mihai Bǎdoiu, Sariel Har-Peled, and Piotr Indyk. Approximate clustering via core-sets. Proceedings of the 34th Symposium on Theory of Computing, 2002.
2. Sariel Har-Peled, and Kasturi R. Varadarajan. Projective Clustering in High Dimensions using Core-Sets. Symposium on Computational Geometry, 2002.
3. Ashish Goel, Piotr Indyk, and Kasturi R. Varadarajan. Reductions among high dimensional proximity problems. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
4. Piyush Kumar, Joseph S. B. Mitchell, and Alper Yildirim, Computing Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. manuscript, 2002.