28 citations · 244 across the 83 of their papers we have counts for
Showing 2020 · cs.DSShow all
3 papers · 2 filters
cs.DS2020
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations
Haim Kaplan, Jay Tenenbaum
Locality Sensitive Hashing (LSH) is an effective method to index a set of points such that we can efficiently find the nearest neighbors of a query point. We extend this method to…
cs.DS2020
Adversarially Robust Streaming Algorithms via Differential Privacy
Avinatan Hassidim, Haim Kaplan, Yishay Mansour +2
A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously, by an adaptive adversary. We est…
cs.DS2020
How to Find a Point in the Convex Hull Privately
Haim Kaplan, Micha Sharir, Uri Stemmer
We study the question of how to compute a point in the convex hull of an input set of points in in a differentially private manner. This question, which is…