Algorithms for dynamic geometric problems over data streams

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 373-380

  Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATABASE SYSTEMS; GEOMETRY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RANDOM ACCESS STORAGE; TREES (MATHEMATICS); VECTORS;

DATA STREAMS; DYNAMIC GEOMETRIC PROBLEMS; MINIMUM SPANNING TREE (MST); MINIMUM WEIGHT MATCHING (MWM);

DATA STRUCTURES;

EID: 4544376723     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007413     Document Type: Conference Paper

References (25)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proceedings of the Symposium on Theory of Computing, pages 20-29, 1996.
2. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. Proceedings of the Symposium on Theory of Computing, 2002.
3. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Proceedings of the Symposium on Foundations of Computer Science, 1996.
4. M. Charikar. Similarity estimation techniques from rounding. Proceedings of the Symposium on Theory of Computing, 2002.
5. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. Proceedings of the Symposium on Foundations of Computer Science, 1998.
6. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. Proceedings of the Symposium on Theory of Computing, pages 30-39, 2003.
7. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. ICALP, 2001.
8. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using hamming norms. Proceedings of the International Conference on Very Large Databases (VLDB), 2002.
9. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. DIMACS Tech Report, 2003.
10. A. Czumaj and C. Sohler. Estimating the weight of metric minimum spanning trees in sublinear-time. Proceedings of the Symposium on Theory of Computing, 2004.
11. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
12. G. Frahling and C. Sohler. Estimating the weight of euclidean minimum spanning trees in data streams. Manuscript, 2004.
13. A. Gilbert, S. Guha, Y. Kotidis, P. Indyk, M. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. Proceedings of the Symposium on Theory of Computing, 2002.
14. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. Proceedings of the Symposium on Theory of Computing, 2001.
15. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-medians and their applications. Proceedings of the Symposium on Theory of Computing, 2004.
16. J. M. Hellerstein, S. Madden, and W. Hong. The sensor spectrum: technology, trends and requirements. SIGMOD Record, December, 2003.
17. M. Hoffman, S. Muthukrishnan, and R. Raman. Location streams: Models and algorithms. manuscript, 2004.
18. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proceedings of the Symposium on Foundations of Computer Science, 2000.
19. P. Indyk and N. Thaper. Fast color image retrieval via embeddings. Workshop on Statistical and Computational Theories of Vision (at ICCV), 2003.
20. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the Thirtieth ACM Symposium on Theory of Computing, pages 614-623, 1998.
21. Adam Meyerson. Online facility location. Proceedings of the Symposium on Foundations of Computer Science, pages 426-431, 2001.
22. K. Munagala. Personal communication. 2003.
23. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. TCS, 12, 1980.
24. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
25. L. A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385-393, 1982.