Optimal private halfspace counting via discrepancy
From MaRDI portal
Publication:5415550
DOI10.1145/2213977.2214090zbMath1286.68469arXiv1203.5453OpenAlexW2115242663MaRDI QIDQ5415550
No author found.
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.5453
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
An Improved Private Mechanism for Small Databases ⋮ Comment ⋮ Computer-aided proof of Erdős discrepancy properties ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ Differentially private range query on shortest paths ⋮ A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ On the hereditary discrepancy of homogeneous arithmetic progressions ⋮ The Complexity of Differential Privacy
This page was built for publication: Optimal private halfspace counting via discrepancy
