1068 search results - page 21 / 214 » Extremely randomized trees |
ECML
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
ALGORITHMICA
2006
13 years 8 months ago
2006
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
ALGORITHMICA
2005
13 years 8 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
RSA
2002
13 years 8 months ago
2002
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...