Sciweavers

2912 search results - page 131 / 583
» Logistic Model Trees
Sort
View
ACL
2007
15 years 5 months ago
K-best Spanning Tree Parsing
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 ...
Keith Hall
125
Voted
ICIP
2005
IEEE
16 years 5 months ago
Detection of semantic objects using description graphs
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...
Ferran Marqués, Xavier Giro
141
Voted
RTA
2000
Springer
15 years 7 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
EOR
2006
110views more  EOR 2006»
15 years 3 months ago
Scatter search with path relinking for phylogenetic inference
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...
Carlos Cotta
CGF
1999
86views more  CGF 1999»
15 years 3 months ago
Generalized View-Dependent Simplification
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...
Jihad El-Sana, Amitabh Varshney