1060 search results - page 15 / 212 » On the Discovery of Random Trees |
141
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
127
click to vote
FUN
2007
Springer
15 years 7 months ago
2007
Springer
This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with ele...
173
click to vote
CAAP
1992
15 years 10 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
215
click to vote
CORR
2011
Springer
15 years 14 days 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...
150
click to vote
IDA
2007
Springer
16 years 3 days ago
2007
Springer
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...