272 search results - page 18 / 55 » Lazy tree splitting |
ACL
2006
13 years 9 months ago
2006
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
MST
2010
13 years 6 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
ACTA
2008
13 years 6 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...