Sciweavers

1528 search results - page 45 / 306
» On Signatures for Communication Graphs
Sort
View
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
13 years 12 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
14 years 2 months ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
CJ
1999
87views more  CJ 1999»
13 years 7 months ago
Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
Mayez A. Al-Mouhamed
ISI
2006
Springer
13 years 7 months ago
Measures to Detect Word Substitution in Intercepted Communication
Abstract. Those who want to conceal the content of their communications can do so by replacing words that might trigger attention by other words or locutions that seem more ordinar...
SzeWang Fong, David B. Skillicorn, Dmitri Roussino...
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 1 months ago
Radio Channel Modelling Using Stochastic Propagation Graphs
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
Troels Pedersen, Bernard H. Fleury