1594 search results - page 64 / 319 » Fast Prediction on a Tree |
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
WIA
2007
Springer
14 years 2 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
ISMB
2001
13 years 9 months ago
2001
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...