Sciweavers

356 search results - page 49 / 72
» Continuous Nearest Neighbor Search
Sort
View
AAAI
2012
13 years 2 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
CVDB
2005
ACM
15 years 2 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
15 years 6 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
204
Voted
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 1 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
101
Voted
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 5 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...