Akhil Arora, Arnab Bhattacharya, Piyush Kumar
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search. In this pap ...
ASSOC COMPUTING MACHINERY2018
