Projective clustering in high dimensions using core-sets
- 5 June 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 312-318
- https://doi.org/10.1145/513400.513440
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate clustering via core-setsPublished by Association for Computing Machinery (ACM) ,2002
- Database-friendly random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three DimensionsJournal of Algorithms, 2001
- Inapproximability of some Geometric and Quadratic Optimization ProblemsPublished by Springer Nature ,2000
- On the complexity of some basic problems in computational convexity: I. Containment problemsDiscrete Mathematics, 1994
- Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spacesMathematical Programming, 1993
- Inner and outerj-radii of convex bodies in finite-dimensional normed spacesDiscrete & Computational Geometry, 1992
- Computing the volume is difficultDiscrete & Computational Geometry, 1987
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984
- On the complexity of locating linear facilities in the planeOperations Research Letters, 1982