Sciweavers

214 search results - page 32 / 43
» Fast Nearest Neighbor Search in High-Dimensional Space
Sort
View
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
14 years 9 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
15 years 2 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...
COMPGEOM
2005
ACM
14 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
CVPR
2004
IEEE
15 years 11 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
15 years 10 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...