1068 search results - page 15 / 214 » Extremely randomized trees |
RSA
2011
13 years 3 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
ACTA
2008
13 years 7 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...
RSA
2006
13 years 8 months ago
2006
Consider the random graph model of Barab
EMNLP
2009
13 years 6 months ago
2009
This paper presents an effective method for generating natural language sentences from their underlying meaning representations. The method is built on top of a hybrid tree repres...
CPC
2002
13 years 8 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...