Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
Amir AbboudKeren Censor-HillelSeri KhouryPublished in: DISC (2016)
Keyphrases
- lower bound
- lower bounding
- distance computation
- upper bound
- multi step
- branch and bound algorithm
- distance function
- nearest neighbor
- lower and upper bounds
- similarity search
- k nearest neighbor
- dynamic time warping
- edit distance
- data sets
- high dimensional data
- euclidean distance
- complex objects
- text classification
- knn
- high dimensional
- optimal solution