906 search results - page 20 / 182 » Matching Subsequences in Trees |
111
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
128
Voted
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
210
Voted
ICDE
2001
IEEE
16 years 5 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
121
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
132
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— In this paper we present a topological map building algorithm based on a Vocabulary Tree that is robust to features present in dynamic or similar environments. The algo...