The following pages link to Christopher Musco (Q2941502):
Displaying 16 items.
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (Q2941504) (← links)
- Uniform Sampling for Matrix Approximation (Q2989029) (← links)
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling (Q4575860) (← links)
- Stability of the Lanczos Method for Matrix Function Approximation (Q4607994) (← links)
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models (Q5002849) (← links)
- Sample Efficient Toeplitz Covariance Estimation (Q5146789) (← links)
- Fast and Space Efficient Spectral Sparsification in Dynamic Streams (Q5146894) (← links)
- A universal sampling method for reconstructing signals with simple Fourier transforms (Q5212845) (← links)
- Error Bounds for Lanczos-Based Matrix Function Approximation (Q5863878) (← links)
- Finding an Approximate Mode of a Kernel Density Estimate. (Q6075955) (← links)
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation (Q6101128) (← links)
- A Tight Analysis of Hutchinson's Diagonal Estimator (Q6407102) (← links)
- Near-linear sample complexity for \(L_p\) polynomial regression (Q6538687) (← links)
- Simple analysis of priority sampling (Q6545119) (← links)
- On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation (Q6645379) (← links)
- Efficient block approximate matrix multiplication (Q6657074) (← links)
