no code implementations • 17 Jul 2019 • Martin Aumüller, Matteo Ceccarello
This paper reconsiders common benchmarking approaches to nearest neighbor search.
1 code implementation • 18 May 2016 • Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Given a dataset of points in a metric space and an integer $k$, a diversity maximization problem requires determining a subset of $k$ points maximizing some diversity objective measure, e. g., the minimum or the average distance between two points in the subset.
Distributed, Parallel, and Cluster Computing