1068 search results - page 15 / 214 » Extremely randomized trees |
113
Voted
RSA
2011
14 years 8 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...
112
Voted
ACTA
2008
15 years 13 days 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...
109
Voted
RSA
2006
15 years 1 months ago
2006
Consider the random graph model of Barab
155
click to vote
EMNLP
2009
14 years 11 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...
111
Voted
CPC
2002
15 years 1 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...