680 search results - page 41 / 136 » A randomized embedding algorithm for trees |
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
FOCS
2003
IEEE
14 years 2 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...
ALGORITHMICA
2002
13 years 8 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
FLAIRS
2004
13 years 10 months ago
2004
Most decision tree induction methods used for extracting knowledge in classification problems are unable to deal with uncertainties embedded within the data, associated with human...
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...