Sciweavers

310 search results - page 29 / 62
» Randomized Binary Search Trees
Sort
View
PPSN
2010
Springer
13 years 8 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 1 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
JBI
2006
13 years 9 months ago
Support versus corroboration
Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are desc...
Mary G. Egan
BMCBI
2011
13 years 4 months ago
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Gr&uum...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr