Coresets in dynamic geometric data streams

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 209-217

  Frahling, Gereon ^a   Sohler, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Computational Geometry; Data Structures; Streaming Algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; DATA STRUCTURES; POLYNOMIALS; PROBABILITY; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

MAXIMUM SPANNING TREE (MAXST); MAXIMUM TRAVELING SALESPERSON (MAXTSP); MAXIMUM WEIGHTED MATCHING (MAXWM); STREAMING ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 33244481434     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060622     Document Type: Conference Paper

References (32)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proc. 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 20-29, 1996.
2. Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, pages 1-10, 2002.
3. A. Bagchi, A. Chaudhary, D. Eppstein and M. T. Goodrich. Deterministic sampling and range counting in geometric data streams. Proc. 20th Annual Symposium on Computational Geometry (SoCG), pp. 144-151, 2004.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), 626-635, 1997.
5. M. Charikar, K. Chen, M. Farach-Colton. Finding Frequent Items in Data Streams. Proc. 29th Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 693-703, 2002.
6. T. M. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions. Proc. 20th Annual Symposium on Computational Geometry (SoCG), pp. 152-159, 2004.
7. T. Chan, B. Sadjad. Geometric Optimization Problems Over Sliding Windows. Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 246-258, 2004.
8. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 30-39, 2003.
9. G. Cormode and S. Muthukrishnan. Radial histograms for spatial streams. DIMACS Technical Report 2003-11, 2003.
10. G. Cormode and S. Muthukrishnan. Improved Data Stream Summaries: The Count-Min Sketch and its Applications. Proc. 6th Latin American Theoretical Informatics (LATIN), pp. 29-38, 2004.
11. G. Cormode and S. Muthukrishnan and I. Rozenbaum. Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Sampling. DIMACS Technical Report 2005-11, 2005.
12. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding window models. Technical Report YALEU/DCS/TR-1245, Yale University, 2002.
13. W. Fernandez de la Vega and C. Kenyon. A Randomized Approximation Scheme for Metric MAX-CUT. J. Comput. Syst. Sci., 63(4):531-541, 2001.
14. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
15. G. Frahling, P. Indyk, and C. Sohler. Sampling in Dynamic Data Streams and Applications. To appear in Proc. 21st Symposium on Computational Geometry, 2005.
16. H.N. Gabow. Data structures for weighted matching and nearest common ancestors with linking Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 434-443, 1990.
17. O. Goldreich, S. Goldwasser, D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
18. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), 359-366, 2000.
19. S. Gunguly, M. Garofalakis, R. Rastogi. Processing Set Expressions over Continuous Update Streams. Proc. ACM SIGMOD, pp. 265-276, 2003.
20. S. Har-Peled and A. Kushal. Smaller Coresets for k-Median and k-Means Clustering. To appear in Proc. 21st Symposium on Computational Geometry, 2005.
21. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-medians and their applications. Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), 291-300, 2004.
22. J. Hershberger and S. Suri. Adaptive sampling for geometric problems over data streams. Proc. ACM Symposium on Principles of Database Systems (PODS), 2004.
23. P. Indyk. Personal communication, 2004.
24. P. Indyk. High-dimensional Computational Geometry. Phd. thesis, Stanford University, 2000.
25. P. Indyk. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 539-545, 2003.
26. P. Indyk. Algorithms for Dynamic Geometric Problems over Data Streams. Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 373-380, 2004.
27. P. Indyk. Better Algorithms for high-dimensional proximity problems via asymmetric embeddings. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 539-545, 2003.
28. A. Meyerson. Online facility location. Proc. IEEE Symposium on Foundations of Computer Science (FOCS), pp. 426-431, 2001.
29. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at SODA'03). Available at http://athos.rutgers.edu/muthu/stream-1-1.ps, 2003.
30. R. Prim. Shortest Connection Networks and some Generalizations. Bell Systems Technical journal, 36:1389-1401, 1957.
31. J. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223-250, 1995.
32. S. Suri, C. D. Toth, and Y. Zhou. Range counting over multidimensional data streams. Proc. 20th Annual Symposium on Computational Geometry, pp. 160-169, 2004.