134 search results - page 26 / 27 » Approximate Nearest Neighbor Queries in Fixed Dimensions |
ICDE
1999
IEEE
14 years 6 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
CIVR
2006
Springer
13 years 9 months ago
2006
Springer
High-dimensional index is one of the most challenging tasks for content-based video retrieval (CBVR). Typically, in video database, there exist two kinds of clues for query: visual...
DCG
2010
13 years 2 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...