This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
This paper presents a technique to detect instances of classes (objects) according to their semantic definition in the form of a Description Graph. Classes are defined as combinat...
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...