3177 search results - page 6 / 636 » Can We Have Confidence in a Tree Representation |
CANDC
2005
ACM
13 years 7 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
ACL
1996
13 years 9 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
AAI
2004
13 years 7 months ago
2004
In open environments in which autonomous agents can break contracts, computational models of trust have an important role to play in determining who to interact with and how inter...
PR
2006
13 years 7 months ago
2006
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
BMCBI
2006
13 years 7 months ago
2006
Background: Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now availab...