Pages that link to "Item:Q3549665"
From MaRDI portal
The following pages link to Sampling-based dimension reduction for subspace approximation (Q3549665):
Displaying 7 items.
- Efficient subspace approximation algorithms (Q664540) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
