Pages that link to "Item:Q5172715"
From MaRDI portal
The following pages link to A fast and efficient algorithm for low-rank approximation of a matrix (Q5172715):
Displaying 6 items.
- Faster least squares approximation (Q623334) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- Effective implementation to reduce execution time of a low-rank matrix approximation problem (Q2231284) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
