This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...