Sciweavers

661 search results - page 33 / 133
» Levels of a scale-free tree
Sort
View
EJC
2000
13 years 11 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 9 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
ICCV
2005
IEEE
14 years 11 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
NETGAMES
2003
ACM
14 years 3 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
INFOCOM
1999
IEEE
14 years 2 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne