Related references
Note: Only part of the references are listed.A randomized algorithm for the decomposition of matrices
Per-Gunnar Martinsson et al.
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2011)
Randomized Kaczmarz solver for noisy linear systems
Deanna Needell
BIT NUMERICAL MATHEMATICS (2010)
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Emmanuel J. Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2010)
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht et al.
SIAM REVIEW (2010)
Exact Matrix Completion via Convex Optimization
Emmanuel J. Candes et al.
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2009)
A Randomized Kaczmarz Algorithm with Exponential Convergence
Thomas Strohmer et al.
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS (2009)
Random projections for the nonnegative least-squares problem
Christos Boutsidis et al.
LINEAR ALGEBRA AND ITS APPLICATIONS (2009)
CUR matrix decompositions for improved data analysis
Michael W. Mahoney et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2009)
SAMPLING ALGORITHMS AND CORESETS FOR l(p) REGRESSION
Anirban Dasgupta et al.
SIAM JOURNAL ON COMPUTING (2009)
A RANDOMIZED ALGORITHM FOR PRINCIPAL COMPONENT ANALYSIS
Vladimir Rokhlin et al.
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2009)
On selecting a maximum volume sub-matrix of a matrix and related problems
Ali Civril et al.
THEORETICAL COMPUTER SCIENCE (2009)
A fast randomized algorithm for the approximation of matrices
Franco Woolfe et al.
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2008)
On the conditioning of random subdictionaries
Joel A. Tropp
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2008)
Low-dimensional embedding of fMRI datasets
Xilin Shen et al.
NEUROIMAGE (2008)
A fast randomized algorithm for overdetermined linear least-squares regression
Vladimir Rokhlin et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2008)
RELATIVE-ERROR CU R MATRIX DECOMPOSITIONS
Petros Drineas et al.
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2008)
Less is More: Sparse Graph Mining with Compact Matrix Decomposition
Jimeng Sun et al.
Statistical Analysis and Data Mining (2007)
Randomized algorithms for the low-rank approximation of matrices
Edo Liberty et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2007)
Fast linear algebra is stable
James Demmel et al.
NUMERISCHE MATHEMATIK (2007)
Sparsity and incoherence in compressive sampling
Emmanuel Candes et al.
INVERSE PROBLEMS (2007)
A randomized algorithm for a tensor-based generalization of the singular value decomposition
Petros Drineas et al.
LINEAR ALGEBRA AND ITS APPLICATIONS (2007)
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson et al.
JOURNAL OF THE ACM (2007)
Compressed sensing
DL Donoho
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
EJ Candès et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
Petros Drineas et al.
SIAM JOURNAL ON COMPUTING (2006)
Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
Petros Drineas et al.
SIAM JOURNAL ON COMPUTING (2006)
Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition
Petros Drineas et al.
SIAM JOURNAL ON COMPUTING (2006)
Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
RR Coifman et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2005)
Condition numbers of gaussian random matrices
ZZ Chen et al.
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2005)
On the compression of low rank matrices
H Cheng et al.
SIAM JOURNAL ON SCIENTIFIC COMPUTING (2005)
Clustering large graphs via the Singular Value Decomposition
P Drineas et al.
MACHINE LEARNING (2004)
Fast Monte-Carlo algorithms for finding low-rank approximations
A Frieze et al.
JOURNAL OF THE ACM (2004)
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
D Achlioptas
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2003)
Construction and arithmetics of H-matrices
L Grasedyck et al.
COMPUTING (2003)
The FERET evaluation methodology for face-recognition algorithms
PJ Phillips et al.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2000)
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2000)
Efficient search for approximate nearest neighbor in high dimensional spaces
E Kushilevitz et al.
SIAM JOURNAL ON COMPUTING (2000)
Minimum cuts in near-linear time
DR Karger
JOURNAL OF THE ACM (2000)
On the existence and computation of rank-revealing LU factorizations
CT Pan
LINEAR ALGEBRA AND ITS APPLICATIONS (2000)
The metropolis algorithm
I Beichl et al.
COMPUTING IN SCIENCE & ENGINEERING (2000)
Share Paper
