We present novel bounds for coreset construction, feature selection, and...
We perturb a real matrix A of full column rank, and derive lower bounds ...
Linear programming (LP) is an extremely useful tool which has been
succe...
Models in which the covariance matrix has the structure of a sparse matr...
We present three provably accurate, polynomial time, approximation algor...
Linear programming (LP) is an extremely useful tool and has been success...
Fisher discriminant analysis (FDA) is a widely used method for classific...
Recent neuroimaging studies have shown that functional connectomes are u...
We initiate the study of numerical linear algebra in the sliding window
...
The von Neumann entropy, named after John von Neumann, is the extension ...
This chapter is based on lectures on Randomized Numerical Linear Algebra...
Coresets are small sets of points that approximate the properties of a l...
We present and analyze a simple, two-step algorithm to approximate the
o...
We introduce single-set spectral sparsification as a deterministic sampl...
We study how well one can recover sparse principal components of a data
...
This paper addresses how well we can recover a data matrix when only giv...
Let X be a data matrix of rank ρ, whose rows represent n points in
d-dim...
We provide fast algorithms for overconstrained ℓ_p regression and
relate...
This paper discusses the topic of dimensionality reduction for k-means
c...