6251 search results - page 236 / 1251 » Randomness, Computability, and Density |
150
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
136
click to vote
ISTCS
1993
Springer
15 years 8 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
127
click to vote
FOCS
1989
IEEE
15 years 8 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
134
click to vote
TCS
1998
15 years 4 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
122
click to vote
ICIC
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...