We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Online banking has become increasingly important to the profitability of financial institutions as well as adding convenience for their customers. As the number of customers using...
Kenneth S. Edge, Richard A. Raines, Michael R. Gri...
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a ...