| Publication | Date of Publication | Type |
|---|
| One-pass additive-error subset selection for \(\ell_p\) subspace approximation | 2024-06-24 | Paper |
One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
Algorithmica | 2023-10-06 | Paper |
On the complexity of constrained determinantal point processes
(available as arXiv preprint) | 2021-07-28 | Paper |
Subspace approximation with outliers
(available as arXiv preprint) | 2021-04-21 | Paper |
| On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling | 2021-03-20 | Paper |
Sampling-based dimension reduction for subspace approximation with outliers
Theoretical Computer Science | 2021-02-03 | Paper |
Subspace approximation with outliers
(available as arXiv preprint) | 2020-06-30 | Paper |
Embedding approximately low-dimensional \(\ell_2^2\) metrics into \(\ell_1\)
(available as arXiv preprint) | 2018-04-19 | Paper |
| Algorithms and hardness for subspace approximation | 2017-09-29 | Paper |
Guruswami-Sinop rounding without higher level Lasserre
(available as arXiv preprint) | 2017-03-22 | Paper |
| On Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes | 2016-07-06 | Paper |
Zero-one rounding of singular vectors
Automata, Languages, and Programming | 2013-08-12 | Paper |
Matrix approximation and projective clustering via volume sampling
Theory of Computing | 2011-05-24 | Paper |
Matrix approximation and projective clustering via volume sampling
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Finding dense subgraphs in \(G(n,1/2)\)
Approximation and Online Algorithms | 2010-05-11 | Paper |
Adaptive Sampling for k-Means Clustering
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
NP-hardness of Euclidean sum-of-squares clustering
Machine Learning | 2009-03-31 | Paper |
Sampling-based dimension reduction for subspace approximation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Adaptive Sampling and Fast Low-Rank Matrix Approximation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Lower bounds for adaptive locally decodable codes
Random Structures & Algorithms | 2005-11-15 | Paper |
