1068 search results - page 48 / 214 » Extremely randomized trees |
IPCO
2008
13 years 10 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
CPC
2004
13 years 8 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
BMCBI
2010
13 years 8 months ago
2010
We study the shape of coverage functions resulting from the sequencing of random genome fragments, and show that they can be described by Galton-Watson trees. This extends standar...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...