Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...