341 search results - page 25 / 69 » Paired bondage in trees |
AI
2007
Springer
14 years 9 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...
COLT
1992
Springer
15 years 1 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
87
Voted
ISMB
1993
14 years 11 months ago
1993
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
72
Voted
PR
2007
14 years 9 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...