80 search results - page 12 / 16 » Nearest Neighbor Search Using Additive Binary Tree |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
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 ...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
DAGM
2004
Springer
14 years 1 months ago
2004
Springer
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...
ICDE
2010
IEEE
14 years 7 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 ...