312 search results - page 24 / 63 » An experimental study on algorithms for drawing binary trees |
JMLR
2010
13 years 2 months ago
2010
Current research on data stream classification mainly focuses on certain data, in which precise and definite value is usually assumed. However, data with uncertainty is quite natu...
IJCAI
2001
13 years 9 months ago
2001
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
BMCBI
2010
13 years 7 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
SCS
2003
13 years 9 months ago
2003
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...