Sciweavers

446 search results - page 4 / 90
» A Combinatorial Theorem for Trees
Sort
View
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 10 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
JCT
2007
149views more  JCT 2007»
13 years 9 months ago
Weighted forms of Euler's theorem
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan’s “lost” notebook, we obtain weighted forms of Euler’s theorem on part...
William Y. C. Chen, Kathy Q. Ji
IANDC
2008
101views more  IANDC 2008»
13 years 9 months ago
Trees with exponentially growing costs
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
Frank Schulz
CP
2009
Springer
14 years 10 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
DM
2008
82views more  DM 2008»
13 years 10 months ago
2-Binary trees: Bijections and related issues
A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2...
Nancy S. S. Gu, Nelson Y. Li, Toufik Mansour