Sciweavers

2924 search results - page 124 / 585
» Lower Bounds in Distributed Computing
Sort
View
93
Voted
MOC
2002
75views more  MOC 2002»
15 years 10 days ago
Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the per
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Frank Emmerich
68
Voted
WCNC
2010
IEEE
15 years 4 months ago
Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading
Abstract—This paper presents a new upper bound on the endto-end signal-to-noise ratio (SNR) of channel-assisted amplifyand-forward (AF) multi-hop relay networks. The harmonic mea...
Gayan Amarasuriya, Chintha Tellambura, Masoud Arda...
PODC
2004
ACM
15 years 6 months ago
Signed quorum systems
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Haifeng Yu
86
Voted
SOFSEM
2005
Springer
15 years 6 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
95
Voted
CISS
2008
IEEE
15 years 7 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He