STOC
2010
ACM
14 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM