4137 search results - page 110 / 828 » On the number of matchings of a tree |
149
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
159
click to vote
MST
2006
15 years 6 months ago
2006
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
212
click to vote
CVPR
2010
IEEE
16 years 18 days ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
143
click to vote
JDA
2007
15 years 6 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a query image, and the system returns a ranked list of i...