A unified framework for approximating and clustering data
Authors:
Open Access
- 6 June 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 569-578
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- From High Definition Image to Low Space Optimization2012
- Algorithms and Hardness for Subspace Approximation2011
- Deterministic sampling and range counting in geometric data streamsACM Transactions on Algorithms, 2007
- Smaller Coresets for k-Median and k-Means ClusteringDiscrete & Computational Geometry, 2006
- Coresets for Discrete Integration and ClusteringLecture Notes in Computer Science, 2006
- No, Coreset, No CryLecture Notes in Computer Science, 2004
- Improved Bounds on the Sample Complexity of LearningJournal of Computer and System Sciences, 2001
- Approximations and Optimal Geometric Divide-and-ConquerJournal of Computer and System Sciences, 1995
- Finding Least-Distances LinesSIAM Journal on Algebraic Discrete Methods, 1983
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability & Its Applications, 1971