Sciweavers

STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 7 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
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...
Holger Dell and Dieter van Melkebeek
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
13 years 7 months ago
Efficiently Learning Mixtures of Two Gaussians
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...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 8 months ago
Connectivity oracles for failure prone graphs
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...
Ran Duan, Seth Pettie
STOC
2010
ACM
153views Algorithms» more  STOC 2010»
13 years 8 months ago
Sorting under partial information (without the ellipsoid algorithm)
Jean Cardinal, Samuel Fiorini, Gwenaël Joret,...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Maintaining a large matching and a small vertex cover
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...
Krzysztof Onak, Ronitt Rubinfeld
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
13 years 8 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden