Sciweavers

1950 search results - page 30 / 390
» Varieties of Increasing Trees
Sort
View
ICMLA
2008
13 years 10 months ago
Decision Tree Ensemble: Small Heterogeneous Is Better Than Large Homogeneous
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
Michael Gashler, Christophe G. Giraud-Carrier, Ton...
PR
2008
206views more  PR 2008»
13 years 8 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
POPL
2012
ACM
12 years 4 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 2 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
BMCBI
2006
107views more  BMCBI 2006»
13 years 8 months ago
Simplifying gene trees for easier comprehension
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...
Paul-Ludwig Lott, Marvin Mundry, Christoph Sassenb...