Sciweavers

325 search results - page 49 / 65
» Group Nearest Neighbor Queries
Sort
View
SAC
2005
ACM
14 years 3 months ago
A pivot-based index structure for combination of feature vectors
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ļ¬...
Benjamin Bustos, Daniel A. Keim, Tobias Schreck
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 11 months ago
A Unified Approach to Approximate Proximity Searching
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...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 10 months ago
Machine learning for online query relaxation
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...
Ion Muslea
AAAI
2012
12 years 6 days ago
Double-Bit Quantization for Hashing
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...
Weihao Kong, Wu-Jun Li
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 11 months ago
Keyword Search on Spatial Databases
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 ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe