We present a novel indexing schema that provides eļ¬cient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The beneļ¬...
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efļ¬cient nearest neighbor search in massive databases due to i...
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...