272 citations · 611 across the 76 of their papers we have counts for
4 papers · 1 filter
On Clusters that are Separated but Large
Sariel Har-Peled, Joseph Rogge
Given a set of points in , consider the problem of computing subsets of that form clusters that are well-separated from each…
How Packed Is It, Really?
Sariel Har-Peled, Timothy Zhou
The congestion of a curve is a measure of how much it zigzags around locally. More precisely, a curve is -packed if the length of the curve lying inside any ball is at most…
On Undecided LP, Clustering and Active Learning
Stav Ashur, Sariel Har-Peled
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) clusters, which are monochromatic (i.e., all…
Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi +2
Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points and a radius parameter , the -near nei…