Sciweavers

FOCS
2010
IEEE
13 years 9 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
FOCS
2010
IEEE
13 years 9 months ago
Deciding First-Order Properties for Sparse Graphs
Zdenek Dvorak, Daniel Král, Robin Thomas
FOCS
2010
IEEE
13 years 9 months ago
Optimal Testing of Reed-Muller Codes
Arnab Bhattacharyya, Swastik Kopparty, Grant Schoe...
FOCS
2010
IEEE
13 years 9 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan