251 search results - page 31 / 51 » When Is Nearest Neighbors Indexable |
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
GIS
2007
ACM
14 years 9 months ago
2007
ACM
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...