Private coresets
From MaRDI portal
Publication:5172730
DOI10.1145/1536414.1536465zbMath1304.94054OpenAlexW2913538792MaRDI QIDQ5172730
Haim Kaplan, Kobbi Nissim, Dan Feldman, Amos Fiat
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536465
Cryptography (94A60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
The automorphism group of a minimal shift of stretched exponential growth ⋮ Streaming submodular maximization under differential privacy noise ⋮ Unnamed Item ⋮ Submodular maximization over data streams with differential privacy noise ⋮ Core-Sets: Updated Survey ⋮ Learning big (image) data via coresets for dictionaries ⋮ Differentially-private learning of low dimensional manifolds
This page was built for publication: Private coresets
