33 citations · 81 across the 24 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CG2015★ 1 cited
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
Sariel Har-Peled, Sepideh Mahabadi
We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates of the dataset to be arbitrarily corrupted or unknown. Formally, given a datase…
cs.DS2015★ 33 cited
Towards Tight Bounds for the Streaming Set Cover Problem
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi +1
We consider the classic Set Cover problem in the data stream model. For elements and sets () we give a -pass algorithm with a strongly sub-linear $\tilde{O…