Pages that link to "Item:Q5176019"

The following pages link to Fast computation of low rank matrix approximations (Q5176019):

Displaying 27 items.

• Recognizing linear structure in noisy matrices (Q556892) (← links)
• Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
• Diffusion representations (Q723009) (← links)
• Column subset selection via sparse approximation of SVD (Q764372) (← links)
• A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
• Random walk with restart: fast solutions and applications (Q929310) (← links)
• Sampling based succinct matrix approximation (Q930090) (← links)
• Noisy random graphs and their laplacians (Q941350) (← links)
• Singular value decomposition of large random matrices (for two-way classification of microarrays) (Q1049547) (← links)
• On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods. (Q1425937) (← links)
• Low-rank decomposition meets kernel learning: a generalized Nyström method (Q1680675) (← links)
• Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
• A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
• Separating populations with wide data: a spectral analysis (Q1951968) (← links)
• Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments (Q2178629) (← links)
• Effective implementation to reduce execution time of a low-rank matrix approximation problem (Q2231284) (← links)
• Matrix estimation by universal singular value thresholding (Q2338924) (← links)
• Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
• A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics (Q2418132) (← links)
• A way for low ranking matrices and its stochastic computations using Monte Carlo method (Q2509434) (← links)
• Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
• Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
• Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
• Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
• (Q4638104) (← links)
• Less is More: Sparse Graph Mining with Compact Matrix Decomposition (Q4969614) (← links)
• \textit{ScreeNOT}: exact MSE-optimal singular value thresholding in correlated noise (Q6046305) (← links)