54 citations · 54 across the 3 of their papers we have counts for
3 papers
cs.GT2011
Dueling Algorithms
Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier +3
We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum…
cs.DS2010
Vertex Sparsifiers and Abstract Rounding Algorithms
Moses Charikar, Tom Leighton, Shi Li +1
The notion of vertex sparsification is introduced in \cite{M}, where it was shown that for any graph and a subset of terminals , there is a polynomial…
cs.LG2010★ 54 cited
Settling the Polynomial Learnability of Mixtures of Gaussians
Ankur Moitra, Gregory Valiant
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has a runnin…