Pass Efficient Algorithms for Approximating Large Matrices

Pass Efficient Algorithms for Approximating Large Matrices (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Petros Drineas , Ravi Kannan

Citations:

27 - 9 self

BibTeX

@MISC{Drineas03passefficient,
    author = {Petros Drineas and Ravi Kannan},
    title = {Pass Efficient Algorithms for Approximating Large Matrices},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

570	The space complexity of approximating the frequency moments - Alon, Matias, et al. - 1999
370	Property testing and its connection to learning and approximation - Goldreich, Goldwasser, et al. - 1998
275	R.: Similarity search in high dimensions via hashing - Gionis, Indyk, et al. - 1999
205	Stable distributions, pseudorandom generators, embeddings, and data stream computation - Indyk
197	Finding frequent items in data streams - Charikar, Chen, et al. - 2002
153	Polynomial time approximation schemes for dense instances of NP-hard problems - Arora, Karger, et al. - 1995
151	Min-wise Independent Permutations - Broder, Charikar, et al. - 1998
150	Two algorithms for nearest-neighbor search in high dimensions - Kleinberg - 1997
141	Computing on data streams - Hezinger, Raghavan, et al. - 1998
137	Fast Monte-Carlo Algorithms for finding low-rank approximations - Frieze, Kannan, et al.
130	Spectral analysis of data - Azar, Fiat, et al. - 2001
121	Data-streams and histograms - Guha, Koudas, et al. - 2001
99	M (2006) Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition - Drineas, Kannan, et al.
98	Approximate clustering via core-sets - Bădoiu, Har-Peled, et al. - 2002
98	Selection and sorting with limited storage - Munro, Paterson - 1980
96	Synopsis data structures for massive data sets - Gibbons, Matias - 1999
96	F (2001) Fast computation of low rank matrix approximations - Achlioptas, McSherry
92	The eigenvalues of random symmetric matrices - Füredi, Komlós - 1981
90	Small-Space Algorithms for Approximate Histogram Maintenance - Fast - 2002
73	Clustering in large graphs and matrices - Drineas, Frieze, et al. - 1999
70	The regularity lemma and approximation schemes for dense problems - Frieze, Kannan - 1996
70	Approximating MultiDimensional Aggregate Range Queries Over Real Attributes - Gunopulos, Kollios, et al. - 1985
64	Spectral partitioning of random graphs - McSherry - 2001
60	Probabilistic counting - Flajolet - 1983
57	Nearoptimal sparse Fourier representations via sampling - Gilbert, Guha, et al. - 2002
51	An approximate L 1 -difference algorithm for massive data streams - Feigenbaum, Kannan, et al.
49	Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication - DRINEAS, KANNAN, et al. - 2006
46	Space lower bounds for distance approximation in the data stream model - Saks, Sun - 2002
43	P.: Competitive recommendation systems - Drineas, Kerenidis, et al. - 2002
28	Approximate counting of inversions in a data stream - Ajtai, Jayram, et al. - 2002
27	Random Projection: A New Approach to VLSI Layout - Vempala - 1998
23	Fast monte-carlo algorithms for approximate matrix multiplication - Drineas, Kannan - 2001
17	Fast Computation of Low Rank Approximations - Achlioptas, McSherry - 2001
13	Sampling lower bounds via information theory - Bar-Yossef - 2003
11	MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms - Vega - 1996
2	An Approximate l 1 -differnce algorithm for massive data sets - Feigenbaum, Kannan, et al. - 1999
2	Sampling subproblems of Max-Cut problems and approximation algorithms - Drineas, Kannan, et al. - 2005
1	Random sub-problems of Max-SNP problems - Alon, DeLaVega, et al. - 2002
1	Amr El Abbadi. Dimensionality reduction for similarity searching in dynamic databases - Kanth, Agrawal - 1998
1	Randomized Algorithms for Matrix Operations - Drineas - 2003