Sciweavers

1068 search results - page 16 / 214
» Extremely randomized trees
Sort
View
NIPS
2007
13 years 10 months ago
Learning the structure of manifolds using random projections
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, Nakul ...
ICIP
2003
IEEE
14 years 1 months ago
Parameter estimation for spatial random trees using the EM algorithm
A new class of multiscale multidimensional stochastic processes called spatial random trees was recently introduced in [9]. The model is based on multiscale stochastic trees with ...
Ilya Pollak, Jeffrey Mark Siskind, Mary P. Harper,...
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 8 months ago
On the survey-propagation equations for the random K-satisfiability problem
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...
Giorgio Parisi
CAAP
1992
14 years 21 days ago
Varieties of Increasing Trees
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...
François Bergeron, Philippe Flajolet, Bruno...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 3 months ago
The total path length of split trees
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...
Nicolas Broutin, Cecilia Holmgren