45 search results - page 3 / 9 » approx 2010 |
APPROX
2010
Springer
14 years 12 days ago
2010
Springer
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
APPROX
2010
Springer
14 years 12 days ago
2010
Springer
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...