FOCS 2010 - PDF Preprint Papers

FOCS 2010 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2010 Paper

click to vote

FOCS
2010
IEEE

227views Theoretical Computer Science» more FOCS 2010»

Boosting and Differential Privacy

13 years 3 months ago

Download www.mit.edu

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	227	Boosting and Differential Privacy	claim
2	207	On the Insecurity of Parallel Repetition for Leakage Resilience	claim
3	206	Stability Yields a PTAS for k-Median and k-Means Clustering	claim
4	187	The Coin Problem and Pseudorandomness for Branching Programs	claim
5	186	Cryptography against Continuous Memory Attacks	claim
6	182	A Non-linear Lower Bound for Planar Epsilon-Nets	claim
7	178	A Fourier-Analytic Approach to Reed-Muller Decoding	claim
8	174	Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions	claim
9	172	The Limits of Two-Party Differential Privacy	claim
10	171	Approximating Maximum Weight Matching in Near-Linear Time	claim
11	165	Learning Convex Concepts from Gaussian Distributions with PCA	claim
12	164	On the Computational Complexity of Coin Flipping	claim
13	163	The Complexity of Distributions	claim
14	159	A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis	claim
15	152	Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction	claim
16	152	Replacement Paths via Fast Matrix Multiplication	claim
17	151	Minimum-Cost Network Design with (Dis)economies of Scale	claim
18	149	Subexponential Algorithms for Unique Games and Related Problems	claim
19	145	Testing Properties of Sparse Images	claim
20	142	Bounded Independence Fools Degree-2 Threshold Functions	claim
21	140	Hardness of Finding Independent Sets in Almost 3-Colorable Graphs	claim
22	135	The Monotone Complexity of k-clique on Random Graphs	claim
23	135	Distance Oracles beyond the Thorup-Zwick Bound	claim
24	135	Subcubic Equivalences between Path, Matrix and Triangle Problems	claim
25	134	Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures	claim
26	129	An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games	claim
27	129	Black-Box Randomized Reductions in Algorithmic Mechanism Design	claim
28	128	Solving Linear Systems through Nested Dissection	claim
29	128	Approaching Optimality for Solving SDD Linear Systems	claim
30	127	Improved Bounds for Geometric Permutations	claim
31	125	On the Queue Number of Planar Graphs	claim
32	123	Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation	claim
33	122	Estimating the Longest Increasing Sequence in Polylogarithmic Time	claim
34	115	Deciding First-Order Properties for Sparse Graphs	claim
35	111	Optimal Testing of Reed-Muller Codes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers