1068 search results - page 68 / 214 » Extremely randomized trees |
ECML
2004
Springer
14 years 3 months ago
2004
Springer
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
CA
2002
IEEE
14 years 2 months ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
CISS
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...