Algorithms for dynamic geometric problems over data streams
- 13 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 373-380
- https://doi.org/10.1145/1007352.1007413
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On coresets for k-means and k-median clusteringPublished by Association for Computing Machinery (ACM) ,2004
- Estimating the weight of metric minimum spanning trees in sublinear-timePublished by Association for Computing Machinery (ACM) ,2004
- The sensor spectrumACM SIGMOD Record, 2003
- Better streaming algorithms for clustering problemsPublished by Association for Computing Machinery (ACM) ,2003
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Similarity estimation techniques from rounding algorithmsPublished by Association for Computing Machinery (ACM) ,2002
- Local search heuristic for k-median and facility location problemsPublished by Association for Computing Machinery (ACM) ,2001
- The space complexity of approximating the frequency momentsPublished by Association for Computing Machinery (ACM) ,1996
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985
- An analysis of the greedy algorithm for the submodular set covering problemCombinatorica, 1982