Sciweavers

1503 search results - page 37 / 301
» Self-optimizing distributed trees
Sort
View
EJC
2010
13 years 10 months ago
The shape of unlabeled rooted random trees
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
Michael Drmota, Bernhard Gittenberger
ICDCS
2002
IEEE
14 years 2 months ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
SDM
2008
SIAM
197views Data Mining» more  SDM 2008»
13 years 11 months ago
A general framework for estimating similarity of datasets and decision trees: exploring semantic similarity of decision trees
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...
Irene Ntoutsi, Alexandros Kalousis, Yannis Theodor...
IGARSS
2009
13 years 7 months ago
Tree Cover, Tree Height and Bare Soil Cover Differences along a Land Use Degradation Gradient in Semi-arid Savannas, South Afric
High resolution airborne hyperspectral and discrete return LiDAR data were used to assess bare soil and tree cover differences along a land use transect consisting of state-owned,...
Renaud Mathieu, Konrad J. Wessels, Gregory Asner, ...
LCN
1999
IEEE
14 years 2 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen