Подписаться
Cameron Musco
Cameron Musco
Подтвержден адрес электронной почты в домене cs.umass.edu - Главная страница
Название
Процитировано
Процитировано
Год
Dimensionality reduction for k-means clustering and low rank approximation
MB Cohen, S Elder, C Musco, C Musco, M Persu
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
3462015
Randomized block krylov methods for stronger and faster approximate singular value decomposition
C Musco, C Musco
Advances in neural information processing systems 28, 2015
251*2015
Uniform sampling for matrix approximation
MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
2032015
Recursive Sampling for the Nyström Method
C Musco, C Musco
arXiv preprint arXiv:1605.07583, 2016
1702016
Single pass spectral sparsification in dynamic streams
M Kapralov, YT Lee, C Musco, C Musco, A Sidford
Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014
1512014
Random fourier features for kernel ridge regression: Approximation bounds and statistical guarantees
H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh
International conference on machine learning, 253-262, 2017
1342017
Input sparsity time low-rank approximation via ridge leverage score sampling
MB Cohen, C Musco, C Musco
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
133*2017
Faster eigenvector computation via shift-and-invert preconditioning
D Garber, E Hazan, C Jin, C Musco, P Netrapalli, A Sidford
International Conference on Machine Learning, 2626-2634, 2016
111*2016
Minimizing polarization and disagreement in social networks
C Musco, C Musco, CE Tsourakakis
Proceedings of the 2018 world wide web conference, 369-378, 2018
862018
Online row sampling
MB Cohen, C Musco, J Pachocki
Theory of Computing 16 (APPROX-RANDOM 2016 Special Issue), 2020
60*2020
Hutch++: Optimal stochastic trace estimation
RA Meyer, C Musco, C Musco, DP Woodruff
Symposium on Simplicity in Algorithms (SOSA), 142-155, 2021
472021
Sublinear time low-rank approximation of positive semidefinite matrices
C Musco, DP Woodruff
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
452017
Near optimal linear algebra in the online and sliding window models
SZ Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco ...
arXiv preprint arXiv:1805.03765, 2018
39*2018
Stability of the Lanczos method for matrix function approximation
C Musco, C Musco, A Sidford
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
352018
Spectrum approximation beyond fast matrix multiplication: Algorithms and hardness
C Musco, P Netrapalli, A Sidford, S Ubaru, DP Woodruff
arXiv preprint arXiv:1704.04163, 2017
342017
Ant-inspired density estimation via random walks
C Musco, HH Su, NA Lynch
Proceedings of the National Academy of Sciences 114 (40), 10534-10541, 2017
332017
Principal component projection without principal component analysis
R Frostig, C Musco, C Musco, A Sidford
International Conference on Machine Learning, 2349-2357, 2016
302016
A universal sampling method for reconstructing signals with simple fourier transforms
H Avron, M Kapralov, C Musco, C Musco, A Velingker, A Zandieh
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
292019
Computational tradeoffs in biological neural networks: Self-stabilizing winner-take-all networks
N Lynch, C Musco, M Parter
arXiv preprint arXiv:1610.02084, 2016
282016
Distributed house-hunting in ant colonies
M Ghaffari, C Musco, T Radeva, N Lynch
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
242015
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20