The following pages link to Cameron Musco (Q2796241):
Displaying 26 items.
- Distributed House-Hunting in Ant Colonies (Q2796242) (← links)
- 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)
- Online Row Sampling (Q4636437) (← links)
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks (Q4638064) (← links)
- Ant-inspired density estimation via random walks (Q4646201) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← 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)
- Ant-Inspired Density Estimation via Random Walks (Q5361971) (← links)
- (Q5857607) (← links)
- Error Bounds for Lanczos-Based Matrix Function Approximation (Q5863878) (← links)
- Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. (Q5875717) (← links)
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation (Q6101128) (← links)
- Sublinear Time Eigenvalue Approximation via Random Sampling (Q6377789) (← links)
- Toeplitz Low-Rank Approximation with Sublinear Query Complexity (Q6417941) (← links)
- Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks (Q6487506) (← links)
- Spiking neural networks through the lens of streaming algorithms (Q6535007) (← links)
- Near-linear sample complexity for \(L_p\) polynomial regression (Q6538687) (← links)
- Sublinear time eigenvalue approximation via random sampling (Q6638013) (← links)
- On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation (Q6645379) (← links)
- Sublinear time low-rank approximation of Toeplitz matrices (Q6645555) (← links)
