141 search results - page 1 / 29 » Destruction of Very Simple Trees |
ALGORITHMICA
2006
13 years 5 months ago
2006
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
APLAS
2005
ACM
13 years 10 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
BMCBI
2010
13 years 5 months ago
2010
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
ECML
2005
Springer
13 years 10 months ago
2005
Springer
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...