Sciweavers

314 search results - page 39 / 63
» Succinct nearest neighbor search
Sort
View
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 8 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
ECAI
2004
Springer
14 years 1 months ago
Local Search Heuristics: Fitness Cloud versus Fitness Landscape
This paper introduces the concept of fitness cloud as an alternative way to visualize and analyze search spaces than given by the geographic notion of fitness landscape. It is ar...
Philippe Collard, Sébastien Vérel, M...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Flexible aggregate similarity search
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects...
Yang Li, Feifei Li, Ke Yi, Bin Yao 0002, Min Wang
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 9 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...