Exponential mechanism

Results: 71



#Item
1Proving Differential Privacy via Probabilistic Couplings Gilles Barthe? ? Marco Gaboardi‡

Proving Differential Privacy via Probabilistic Couplings Gilles Barthe? ? Marco Gaboardi‡

Add to Reading List

Source URL: tpdp16.cse.buffalo.edu

Language: English - Date: 2016-06-08 10:33:12
2PI MU EPSILON JOURNAL THE OCTIOAL PUBLICATIONOF THEHONORARYMAnffiMATICALFRATERNITY  VOLUME 2

PI MU EPSILON JOURNAL THE OCTIOAL PUBLICATIONOF THEHONORARYMAnffiMATICALFRATERNITY VOLUME 2

Add to Reading List

Source URL: www.pme-math.org

Language: English - Date: 2013-10-17 15:52:19
3Generalization in Adaptive Data Analysis and Holdout Reuse Cynthia Dwork∗ Vitaly Feldman†  Moritz Hardt‡

Generalization in Adaptive Data Analysis and Holdout Reuse Cynthia Dwork∗ Vitaly Feldman† Moritz Hardt‡

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-09-27 20:31:04
4Privacy by the Numbers: A New Approach to Safeguarding Data: Scientific American:32 PM Permanent Address: http://www.scientificamerican.com/article.cfm?id=privacy-by-the-numbers-a-new-approach-to-safeguarding

Privacy by the Numbers: A New Approach to Safeguarding Data: Scientific American:32 PM Permanent Address: http://www.scientificamerican.com/article.cfm?id=privacy-by-the-numbers-a-new-approach-to-safeguarding

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2013-10-27 19:36:57
5Differentially Private Integer Partitions and their Applications Jeremiah Blocki Microsoft Research Abstract Given a positive integer N ≥ 0 a partition of N is a non-increasing sequence of numbers x1 ≥ x2 . . . ≥ x

Differentially Private Integer Partitions and their Applications Jeremiah Blocki Microsoft Research Abstract Given a positive integer N ≥ 0 a partition of N is a non-increasing sequence of numbers x1 ≥ x2 . . . ≥ x

Add to Reading List

Source URL: tpdp16.cse.buffalo.edu

Language: English - Date: 2016-06-08 10:11:54
6R Foundations and Trends⃝ in Theoretical Computer Science Vol. 9, Nos. 3––407 c 2014 C. Dwork and A. Roth

R Foundations and Trends⃝ in Theoretical Computer Science Vol. 9, Nos. 3––407 c 2014 C. Dwork and A. Roth

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2015-03-06 20:30:08
7Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany

Efficient Sampling Methods for Discrete Distributions Karl Bringmann and Konstantinos Panagiotou Max Planck Institute for Informatics Campus E1.4, 66123 Saarbr¨ ucken, Germany

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:38
8Learning Programs from Noisy Data Veselin Raychev Pavol Bielik  Martin Vechev

Learning Programs from Noisy Data Veselin Raychev Pavol Bielik Martin Vechev

Add to Reading List

Source URL: www.srl.inf.ethz.ch

Language: English - Date: 2015-11-15 16:23:35
9Privacy-Preserving Data Exploration in Genome-Wide Association Studies ∗ Aaron Johnson

Privacy-Preserving Data Exploration in Genome-Wide Association Studies ∗ Aaron Johnson

Add to Reading List

Source URL: ohmygodel.com

Language: English - Date: 2013-11-05 12:58:30
10The Sample Complexity of Revenue Maximization Richard Cole ∗ Tim Roughgarden †  Courant Institute

The Sample Complexity of Revenue Maximization Richard Cole ∗ Tim Roughgarden † Courant Institute

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-11-25 19:06:52