240 search results - page 3 / 48 » Forest for the trees |
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Grafted trees are trees that are constructed using two methods. The first method creates an initial tree, while the second method is used to complete the tree. In this work, the fi...
SIAMCOMP
2008
13 years 7 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—We introduce and validate Spatiotemporal Relational Random Forests, which are random forests created with spatiotemporal relational probability trees. We build on the do...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...