4137 search results - page 321 / 828 » On the number of matchings of a tree |
110
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a for...
170
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We describe a simple model for parsing pedestrians based on shape. Our model assembles candidate parts from an oversegmentation of the image and matches them to a library of exemp...
187
click to vote
RECOMB
2009
Springer
16 years 7 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
192
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
152
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...