Sciweavers

50 search results - page 5 / 10
» On the bit communication complexity of randomized rumor spre...
Sort
View
SPAA
2009
ACM
14 years 4 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
VTC
2006
IEEE
14 years 3 months ago
Accurate BER Analysis of Asynchronous DS-CDMA Systems in Ricean Channels
— The accurate Bit Error Rate (BER) calculation of an asynchronous Ricean-faded DS-CDMA system using random spreading sequences and BPSK modulation is studied in this paper. A ne...
Xiang Liu, Lajos Hanzo
TSP
2008
166views more  TSP 2008»
13 years 9 months ago
A Unifying Discussion of Correlation Analysis for Complex Random Vectors
The assessment of multivariate association between two complex random vectors is considered. A number of correlation coefficients based on three popular correlation analysis techni...
Peter J. Schreier
ICALP
2007
Springer
14 years 4 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
GLOBECOM
2007
IEEE
13 years 10 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar