Sciweavers

29908 search results - page 100 / 5982
» On the complexity of communication complexity
Sort
View
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 4 months ago
Performance of Interleave Division Multiple Access Based on Minimum Mean Square Error Detection
— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
Katsutoshi Kusume, Guido Dietl, Wolfgang Utschick,...
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
SPAA
2009
ACM
15 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
LDVF
2000
102views more  LDVF 2000»
14 years 9 months ago
Imperatives, Commitment and Action: Towards a Constraint-based Model
The aim of this paper is to provide an analysis of the function of imperatives in dialogue. In particular, the focus is on the use of logically complex imperatives (e.g., `Say hel...
Paul Piwek
VTC
2010
IEEE
122views Communications» more  VTC 2010»
14 years 7 months ago
Space-Time Codes with Block-Orthogonal Structure and Their Simplified ML and Near-ML Decoding
Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding schem...
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Er Yang...