1068 search results - page 7 / 214 » Extremely randomized trees |
WIA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
BMCBI
2011
13 years 3 months ago
2011
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
IJRR
2011
13 years 3 months ago
2011
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
ALGORITHMS
2010
13 years 6 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
EMNLP
2006
13 years 10 months ago
2006
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...