Pass efficient algorithms for approximating large matrices

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 223-232

  Drineas, Petros ^a   Kannan, Ravi ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; GRAPH THEORY; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; PRINCIPAL COMPONENT ANALYSIS; RANDOM ACCESS STORAGE; SAMPLING; VECTORS;

ADAPTIVE SAMPLING; MAXIMUM CUT PROBLEM;

MATRIX ALGEBRA;

EID: 0038416092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. D. Achlioptas and F. McSherry. Fast computation of low rank approximations. Proceedings of the 33rd Annual Symposium on Theory of Computing, 2001.
2. M. Ajtai, T. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. Proceedings of the 34th Annual Symposium on Theory of Computing, 2002.
3. N. Alon, W.F. DeLaVega, R. Kannan, and M. Karpinski. Random sub-problems of Max-SNP problems. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996.
5. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995.
6. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. Proc. of the 33rd ACM Symposium on Theory of Computing, 2001.
7. M. Badoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core sets. Proceedings of the 34th Annual Symposium on Theory of Computing, 2002.
8. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998.
9. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. International Colloquium on Automata, Languages and Programming, 2002.
10. W. Fernandez de-la Vega. Max-cut has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8:187-199, 1996.
11. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
12. P. Drineas and R. Kannan. Fast monte-carlo algorithms for approximate matrix multiplication. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001.
13. P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 668-667, 2002.
14. 1-difference algorithm for massive data sets. Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999.
15. P. Flajolet and G. Martin. Probabilistic counting. Proc. 24th IEEE Symp. on Foundations of Computer Science, 1983.
16. A. Frieze and R. Kannan. The regularity lemma and approximation schemes for dense problems. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, 1996.
17. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low rank approximations. Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998.
18. Z. Furedi and J. Komlos. The eigenvalues of random symmetric matrices. Combinatorica, 1:233-241, 1981.
19. P. Gibbons and Y. Matias. Synopsis data structures for massive data sets. DIMACS Series in Discrite Mathematics and Theoretical Computer Science: Special Issue on external memory algorithms and visualization, American Mathematical Society, pages 39-70, 1999.
20. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintanance. Proceedings of the 34th Annual Symposium on Theory of Computing, 2002.
21. A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near optimal sparse fourier representations via sampling. Proceedings of the 34th Annual Symposium on Theory of Computing, 2002.
22. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. Proceedings of the 25th VLDB Conference, 1999.
23. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, 1996.
24. G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, 1989.
25. S. Guha, N. Koudas, and K. Shim. Data streams and histograms. Proceedings of the 33rd Annual Symposium on Theory of Computing, 2001.
26. D. Gunopoulos, G. Kollios, V. Tsotras, and C. Domeniconi. Approximate multi-dimensional aggregate range queries over real attributes. Proceedings of ACM SIGMOD conference, 2000.
27. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical note 1998-011, Digital Systems Research Center, Palo Alto, CA, May
28. P. Indyk. Stable distributions, pseudo-random generators, embeddings, and data stream computation. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computing, 2000.
29. R. Kanth, D. Agrawal, and Amr El Abbadi. Dimensionality reduction for similarity searching in dynamic databases. ACM SIGMOD, 1998.
30. J. Kleinberg. Two algorithms for nearest neighbor search in high dimensions. Proceedings of the 29th Symposium on Theory of Computing, 1997.
31. F. McSherry. Spectral partitioning of random graphs. Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001.
32. J.I. Munro and M.S. Paterson. Selection and sorting with limited storage. Proceedings of the 19th Annual IEEE Symposium on Foundations of Computing, 1978.
33. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. Proceedings of the 34th Annual Symposium on Theory of Computing, 2002.
34. S. Vempala. Random Projection: A new approach to VLSI layout. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computing, 1998.