1 citations · 1 across the 8 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2
We study the -center problem in the context of individual fairness. Let be a set of points in a metric space and be the distance between and its $\lceil…
cs.DS2024★ 1 cited
On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
Michael Kapralov, Mikhail Makarov, Christian Sohler
Locality-sensitive hashing~[Indyk,Motwani'98] is a classical data structure for approximate nearest neighbor search. It allows, after a close to linear time preprocessing of the in…