4137 search results - page 122 / 828 » On the number of matchings of a tree |
174
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
176
click to vote
NETWORKING
2004
15 years 7 months ago
2004
Subset Difference Revocation (SDR) [8] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message ove...
133
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
221
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
285
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...