16430 search results - page 276 / 3286 » On Computable Tree Functions |
128
click to vote
AINTEC
2007
Springer
15 years 10 months ago
2007
Springer
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
140
Voted
SOFSEM
2004
Springer
15 years 10 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
134
click to vote
RECOMB
1997
Springer
15 years 8 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
109
Voted
FEGC
2008
15 years 6 months ago
2008
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
121
click to vote
AI
2007
Springer
15 years 4 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...