Sciweavers

1528 search results - page 73 / 306
» On Signatures for Communication Graphs
Sort
View
ASIAMS
2007
IEEE
14 years 2 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
DATE
2008
IEEE
126views Hardware» more  DATE 2008»
14 years 2 months ago
De Bruijn Graph as a Low Latency Scalable Architecture for Energy Efficient Massive NoCs
In this paper, we use the generalized binary de Bruijn (GBDB) graph as a scalable and efficient network topology for an on-chip communication network. Using just two-layer wiring,...
Mohammad Hosseinabady, Mohammad Reza Kakoee, Jimso...
INFOCOM
1999
IEEE
13 years 12 months ago
Multicast Security: A Taxonomy and Some Efficient Constructions
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, ...
Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Mi...
ICC
2007
IEEE
14 years 2 months ago
Unifying Characterization of Max-Min Fairness in Wireless Networks by Graphs
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
Marcin Wiczanowski, Holger Boche, Slawomir Stancza...
AINA
2010
IEEE
14 years 14 days ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli