3055 search results - page 56 / 611 » Randomized Search Trees |
102
click to vote
AAAI
1998
15 years 3 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
115
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
125
Voted
JCB
2006
15 years 2 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
104
click to vote
AAAI
1994
15 years 3 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
104
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...