Sciweavers

4137 search results - page 38 / 828
» On the number of matchings of a tree
Sort
View
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 7 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
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
DM
2008
104views more  DM 2008»
13 years 7 months ago
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
Florent R. Madelaine, Iain A. Stewart
ATAL
2004
Springer
14 years 1 months ago
Preference Elicitation without Numbers
The development of autonomous multi-agent systems acting upon the interests of one or more users involves the elicitation of preferences of these users. In decision theory, models...
P. H. M. P. Roelofsma, Martijn C. Schut
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 2 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain