4137 search results - page 118 / 828 » On the number of matchings of a tree |
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
161
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
182
click to vote
IJCGA
2006
15 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
181
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper presents a new geometric framework for analysis of planar treelike shapes for applications such as shape matching, recognition and morphology, using the geometry of the...
155
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Matching feature points between images is a key point in many Computer Vision tasks. As the number of images increases, this rapidly becomes a bottleneck. We here present how to u...