Pages that link to "Item:Q5435673"
From MaRDI portal
The following pages link to Fast monte-carlo algorithms for finding low-rank approximations (Q5435673):
Displayed 19 items.
- CUR matrix decompositions for improved data analysis (Q134075) (← links)
- A spectral algorithm for learning mixture models (Q598259) (← links)
- A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
- How to get close to the median shape (Q870425) (← links)
- Sampling based succinct matrix approximation (Q930090) (← links)
- Random matrices: The distribution of the smallest singular values (Q987365) (← links)
- Towards theory of generic principal component analysis (Q1002348) (← links)
- A randomized Kaczmarz algorithm with exponential convergence (Q1027734) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Web document clustering using hyperlink structures (Q1874119) (← links)
- Fast low-rank modifications of the thin singular value decomposition (Q2368737) (← links)
- Stochastic iterative projection methods for large linear systems (Q3068189) (← links)
- Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Generalized low rank approximations of matrices (Q5896779) (← links)
- Generalized low rank approximations of matrices (Q5920549) (← links)