Sciweavers

19 search results - page 2 / 4
» Analysis of Some Parameters for Random Nodes in Priority Tre...
Sort
View
CAAP
1992
13 years 9 months ago
Varieties of Increasing Trees
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
François Bergeron, Philippe Flajolet, Bruno...
AI
2006
Springer
13 years 5 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 5 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 9 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ICC
2009
IEEE
148views Communications» more  ICC 2009»
13 years 12 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
Sérgio Crisóstomo, Udo Schilcher, Ch...