The similarity search has become a fundamental computational task in many applications. One of the mathematical models of the similarity – the metric space – has drawn attenti...
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...