Sciweavers

5699 search results - page 214 / 1140
» Alternating model trees
Sort
View
IEEEARES
2010
IEEE
16 years 1 months ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...
153
Voted
CAI
2007
Springer
16 years 9 days ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
181
Voted
GBRPR
2009
Springer
15 years 10 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri
AB
2008
Springer
15 years 8 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
158
Voted
JOLLI
2010
94views more  JOLLI 2010»
15 years 4 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird