Sciweavers

254 search results - page 11 / 51
» On randomized one-round communication complexity
Sort
View
ICC
2007
IEEE
14 years 1 months ago
A Statistical Bit Error Generator for Emulation of Complex Forward Error Correction Schemes
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...
Reuben A. Farrugia, Carl James Debono
INFOCOM
2007
IEEE
14 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 4 days ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
CEC
2005
IEEE
14 years 1 months ago
Music evolution in a complex system of interacting agents
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
Tao Gong, Qian Zhang, Hua Wu
ISCAS
2006
IEEE
93views Hardware» more  ISCAS 2006»
14 years 1 months ago
Discontinuity-induced bifurcations in TCP/RED communication algorithms
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...
Mingjian Liu, A. Marciello, Mario di Bernardo, Lji...