Results 271 to 280 of about 2,906,539 (296)
Some of the next articles are maybe not open access.

Random Sequential Adsorption on Random Trees

Journal of Statistical Physics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

SIAM Journal on Computing, 1999
The random hash tree and the N-tree were introduced by Ehrlich in 1981. In the random hash tree, n data points are hashed to values X 1 , . . . , X n , independently and identically distributed random variables taking values that are uniformly ...
openaire   +3 more sources

Random walks on trees

2005
Random walks or Brownian motions appear as a useful tool in algorithm analysis. Recently P. Flajolet ([2]) obtained a complete and detailed analysis of the two stacks problem with the help of properties of simple random walks on lattices. G. Louchard ([7], [8]) proved that the Brownian motion permits to give easily asymptotic results on the complexity ...
openaire   +1 more source

On random 2?3 trees

Acta Informatica, 1978
It is shown that ¯n (N), the average number of nodes in an N-key random 2---3 tree, satisfies the inequality 0.70 N < ¯n(N)
openaire   +2 more sources

Random Feature Weights for Decision Tree Ensemble Construction

Information Fusion, 2012
Jesus Maudes   +2 more
exaly  

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

SIAM Journal on Discrete Mathematics, 1990
David Aldous
exaly  

The Continuum Random Tree III

Annals of Probability, 1993
David Aldous
exaly  

Home - About - Disclaimer - Privacy