Nathan Halko

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Randomized algorithms for the low-rank approximation of matrices 2007 Edo Liberty
Franco Woolfe
Per‐Gunnar Martinsson
Vladimir Rokhlin
Mark Tygert
3
+ PDF Chat Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start 1992 J. Kuczyński
H. Woźniakowski
3
+ Estimating Extremal Eigenvalues and Condition Numbers of Matrices 1983 John D. Dixon
3
+ A Randomized Algorithm for the Approximation of Matrices 2006 Per‐Gunnar Martinsson
Vladimir Rockhlin
Mark Tygert
3
+ PDF Chat A Randomized Algorithm for Principal Component Analysis 2009 Vladimir Rokhlin
Arthur Szlam
Mark Tygert
3
+ PDF Chat Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions 2011 Nathan Halko
Per‐Gunnar Martinsson
Joel A. Tropp
2
+ A fast randomized algorithm for the approximation of matrices 2007 Franco Woolfe
Edo Liberty
Vladimir Rokhlin
Mark Tygert
2
+ Fast computation of low-rank matrix approximations 2007 Dimitris Achlioptas
Frank McSherry
1
+ A randomized algorithm for a tensor-based generalization of the singular value decomposition 2006 Petros Drineas
Michael W. Mahoney
1
+ PDF Chat On Talagrand's deviation inequalities for product measures 1997 Michel Ledoux
1
+ PDF Chat Eigenvalues and Condition Numbers of Random Matrices 1988 Alan Edelman
1
+ Fast monte-carlo algorithms for finding low-rank approximations 2004 Alan Frieze
Ravi Kannan
Santosh Vempala
1
+ PDF Chat Gaussian Processes and Almost Spherical Sections of Convex Bodies 1988 Y. Gordon
1
+ PDF Chat On sparse representations of linear operators and the approximation of matrix products 2008 Mohamed-Ali Belabbas
Patrick J. Wolfe
1
+ PDF Chat Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces 1985 Bernd Carl
1
+ PDF Chat Relative-Error $CUR$ Matrix Decompositions 2008 Petros Drineas
Michael W. Mahoney
S. Muthukrishnan
1
+ Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition 2006 Petros Drineas
Ravi Kannan
Michael W. Mahoney
1
+ PDF Chat Low-dimensional embedding of fMRI datasets 2008 Xilin Shen
François G. Meyer
1
+ Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps 2005 Ronald R. Coifman
Stéphane Lafon
A. B. Lee
Mauro Maggioni
Boaz Nadler
Frederick Warner
Steven W. Zucker
1
+ PDF Chat Faster least squares approximation 2010 Petros Drineas
Michael W. Mahoney
S. Muthukrishnan
Tamás Sarlós
1
+ Numerical methods for least squares problems 1996 Åke Björck
1
+ Sampling Algorithms and Coresets for $\ell_p$ Regression 2009 Anirban Dasgupta
Petros Drineas
Boulos Harb
Ravi Kumar
Michael W. Mahoney
1
+ PDF Chat On the conditioning of random subdictionaries 2007 Joel A. Tropp
1
+ On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems 1977 G. W. Stewart
1
+ Subgradient and sampling algorithms for l1 regression 2005 Kenneth L. Clarkson
1
+ Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix 1969 G. W. Stewart
1
+ Some inequalities for Gaussian processes and applications 1985 Y. Gordon
1
+ Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication 2006 Petros Drineas
Ravi Kannan
Michael W. Mahoney
1
+ PDF Chat A Randomized Kaczmarz Algorithm with Exponential Convergence 2008 Thomas Strohmer
Roman Vershynin
1
+ The Monte Carlo Method 1949 N. Metropolis
Stanislaw M. Ulam
1
+ Numerics of Gram-Schmidt orthogonalization 1994 Åke Björck
1
+ A randomized algorithm for the decomposition of matrices 2010 Per‐Gunnar Martinsson
Vladimir Rokhlin
Mark Tygert
1
+ PDF Chat Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation 1968 Kumar Jogdeo
Stephen M. Samuels
1
+ On lipschitz embedding of finite metric spaces in Hilbert space 1985 Jean Bourgain
1
+ PDF Chat SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS 1960 L. Mirsky
1
+ Clustering in large graphs and matrices 1999 Petros Drineas
Alan Frieze
Ravi Kannan
Santosh Vempala
Vishwa Vinay
1
+ Operator Khintchine inequality in non-commutative probability 2001 Artur Buchholz
1
+ A theory of pseudoskeleton approximations 1997 S. A. Goreinov
Е. Е. Тыртышников
Н. Л. Замарашкин
1
+ Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start 1998 Zbigniew Leyk
Henryk Woźniakowski
1
+ A fast and efficient algorithm for low-rank approximation of a matrix 2009 Nam Nguyen
T. Thong
Trac D. Tran
1
+ PDF Chat Efficient Volume Sampling for Row/Column Subset Selection 2010 Amit Deshpande
Luis Rademacher
1
+ PDF Chat Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements 2006 Mark Rudelson
Roman Vershynin
1
+ Matrix approximation and projective clustering via volume sampling 2006 Amit Deshpande
Luis Rademacher
Santosh Vempala
Grant Wang
1
+ EM Algorithms for PCA and SPCA 1997 Sam T. Roweis
1
+ PDF Chat Sparsity and incoherence in compressive sampling 2007 Emmanuel J. Candès
Justin Romberg
1
+ PDF Chat Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization 2010 Benjamin Recht
Maryam Fazel
Pablo A. Parrilo
1
+ PDF Chat Dense Fast Random Projections and Lean Walsh Transforms 2008 Edo Liberty
Nir Ailon
Amit Singer
1
+ PDF Chat Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization 1996 Ming Gu
Stanley C. Eisenstat
1
+ Aspects of Multivariate Statistical Theory 1984 Leon Jay Gleser
Robb J. Muirhead
1
+ Random projections for the nonnegative least-squares problem 2009 Christos Boutsidis
Petros Drineas
1