The space complexity of pass-efficient algorithms for clustering

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1157-1166

  Chang, Kevin L ^a   Kannan, Ravi ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; PROBABILITY DENSITY FUNCTION;

CLUSTERING PROBLEM; CRITICAL RESOURCE; PASS STREAMING ALGORITHMS; UNIFORM DISTRIBUTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 33244464091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109685     Document Type: Conference Paper

References (19)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 20-29, 1996.
2. S. Arora and R. Kannan. Learning mixtures of arbitrary gaussians. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 247-257, 2001.
3. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 209-218, 2002.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 626-635, 1997.
5. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, pages 30-39, 2003.
6. S. Chaudhuri, R. Motwani, and V. R. Narasayya. Random sampling for histogram construction: How much is enough? In SIGMOD Conference, pages 436-447, 1998.
7. S. DasGupta. Learning mixtures of gaussians. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 634-644, 1999.
8. P. Drineas and R. Kannan. Pass efficient algorithm for large matrices. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 2003.
9. J. Feigenbaum, S. Kannan, A. McGregor, and S. Suri. Graph distances in the streaming model: The value of space. In Proceedings of the 16th Symposium on Discrete Algorithms, pages 745-754, 2005.
10. P. B. Gibbons, Y. Matias, and V. Poosala. Fast incremental maintenance of approximate histograms. In Proceedings of 23th International Conference on Very Large Data Bases, pages 266-275, 1997.
11. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pages 389-398, 2002.
12. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 471-475, 2001.
13. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. External memory algorithms, pages 107-118, 1999.
14. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. In Proceedings of the 41th IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
15. P. indyk and D. Woodruff. Optimal approximations of the frequency moments of data streams. In Proceedings of the 37th Annual ACM Symposium on the Theory of Computing, pages 202-208, 2005.
16. H. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In Proceedings of 24th International Conference on Very Large Data Bases, pages 275-286, 1998.
17. Y. Matias, J. S. Vitter, and M. Wang. Dynamic maintenance of wavelet-based histograms. In Proceedings of 26th International Conference on Very Large Data Bases, pages 101-110, 2000.
18. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37-49, 1998.
19. J. I. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, 12:315-323, 1980.