Sciweavers

1503 search results - page 8 / 301
» Self-optimizing distributed trees
Sort
View
RSA
2006
78views more  RSA 2006»
13 years 7 months ago
Nodes of large degree in random trees and forests
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
Bernhard Gittenberger
JSYML
2011
71views more  JSYML 2011»
13 years 2 months ago
The club principle and the distributivity number
Abstract. We give an affirmative answer to Brendle’s and Hruˇs´ak’s question of whether the club principle together with h > ℵ1 is consistent. We work with a class of ax...
Heike Mildenberger
ALT
2007
Springer
14 years 4 months ago
Learning Rational Stochastic Tree Languages
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
François Denis, Amaury Habrard
OPODIS
2004
13 years 8 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 3 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach