Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
est case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search e ciency. Such a speed-up is predicted by various analytical models develope...
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...