Pages that link to "Item:Q664540"
From MaRDI portal
The following pages link to Efficient subspace approximation algorithms (Q664540):
Displaying 6 items.
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- Optimal expansion of subspaces for eigenvector approximations (Q2469518) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- Computer algorithms for calculating efficient initial vectors for subspace iteration method (Q3766708) (← links)
