Search
Now showing items 1-1 of 1
A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems
(ACM, 2021-06-20)
In this paper, we revisit a suite of popular proximity problems
(such as, KNN, clustering, minimum spanning tree) that repeatedly
perform distance computations to compare distances during their
execution. Our effort ...