4137 search results - page 103 / 828 » On the number of matchings of a tree |
146
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
With the rapid growth in the number of online Web services, the problem of service adaptation has received significant attention. In matching and adaptation, the functional descri...
192
click to vote
PAMI
2006
15 years 6 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
224
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
141
click to vote
EJC
2006
15 years 6 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
179
click to vote
NBIS
2007
Springer
16 years 17 days ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...