An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...