462 search results - page 38 / 93 » Covering a Tree by a Forest |
COLING
2010
14 years 4 months ago
2010
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
EJC
2007
14 years 9 months ago
2007
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
122
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...