4137 search results - page 9 / 828 » On the number of matchings of a tree |
DAM
2007
13 years 7 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...