Sciweavers

346 search results - page 47 / 70
» Propagating Probabilities in System P
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 1 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
TSP
2010
14 years 6 months ago
MIMO transceivers with decision feedback and bit loading: theory and optimization
This paper considers MIMO transceivers with linear precoders and decision feedback equalizers (DFEs), with bit allocation at the transmitter. Zero-forcing (ZF) is assumed. Consider...
Ching-Chih Weng, Chun-Yang Chen, P. P. Vaidyanatha...
ADHOC
2007
144views more  ADHOC 2007»
14 years 12 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
FOCS
2004
IEEE
15 years 3 months ago
Optimal Power-Down Strategies
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active a...
John Augustine, Sandy Irani, Chaitanya Swamy
WETICE
2007
IEEE
15 years 6 months ago
Collaborative Intrusion Prevention
Intrusion Prevention Systems (IPSs) have long been proposed as a defense against attacks that propagate too fast for any manual response to be useful. In an important class of IPS...
Simon P. Chung, Aloysius K. Mok