activity
20202025
most citedDifferentially Private Multi-Armed Bandits in the Shuffle Model

5 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

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…