Alert button
Picture for Christopher Musco

Christopher Musco

Alert button

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

Dec 20, 2018
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh

Figure 1 for A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Figure 2 for A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Figure 3 for A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Figure 4 for A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
Viaarxiv icon

Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees

May 21, 2018
Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh

Figure 1 for Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
Viaarxiv icon

Learning Networks from Random Walk-Based Node Similarities

Jan 23, 2018
Jeremy G. Hoskins, Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis

Figure 1 for Learning Networks from Random Walk-Based Node Similarities
Figure 2 for Learning Networks from Random Walk-Based Node Similarities
Figure 3 for Learning Networks from Random Walk-Based Node Similarities
Figure 4 for Learning Networks from Random Walk-Based Node Similarities
Viaarxiv icon

Minimizing Polarization and Disagreement in Social Networks

Dec 28, 2017
Cameron Musco, Christopher Musco, Charalampos E. Tsourakakis

Figure 1 for Minimizing Polarization and Disagreement in Social Networks
Figure 2 for Minimizing Polarization and Disagreement in Social Networks
Figure 3 for Minimizing Polarization and Disagreement in Social Networks
Figure 4 for Minimizing Polarization and Disagreement in Social Networks
Viaarxiv icon

Recursive Sampling for the Nyström Method

Nov 03, 2017
Cameron Musco, Christopher Musco

Figure 1 for Recursive Sampling for the Nyström Method
Figure 2 for Recursive Sampling for the Nyström Method
Figure 3 for Recursive Sampling for the Nyström Method
Figure 4 for Recursive Sampling for the Nyström Method
Viaarxiv icon

Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling

Oct 06, 2016
Michael B. Cohen, Cameron Musco, Christopher Musco

Viaarxiv icon

Principal Component Projection Without Principal Component Analysis

Feb 22, 2016
Roy Frostig, Cameron Musco, Christopher Musco, Aaron Sidford

Figure 1 for Principal Component Projection Without Principal Component Analysis
Figure 2 for Principal Component Projection Without Principal Component Analysis
Figure 3 for Principal Component Projection Without Principal Component Analysis
Viaarxiv icon

Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition

Oct 30, 2015
Cameron Musco, Christopher Musco

Figure 1 for Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Figure 2 for Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Figure 3 for Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Viaarxiv icon

Dimensionality Reduction for k-Means Clustering and Low Rank Approximation

Apr 03, 2015
Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, Madalina Persu

Figure 1 for Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
Viaarxiv icon

Uniform Sampling for Matrix Approximation

Aug 21, 2014
Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford

Viaarxiv icon