Sciweavers

5793 search results - page 217 / 1159
» Individual communication complexity
Sort
View
GLOBECOM
2006
IEEE
16 years 20 days ago
Low-Complexity Turbo Equalization for Alamouti Space-Time Block Coded EDGE Systems
— Enhanced Data Rates for Global Evolution (EDGE) based systems are expected to facilitate the same services as third generation WCDMA systems. This goal is achieved through phys...
K. C. B. Wavegedara, Vijay K. Bhargava
MM
2006
ACM
143views Multimedia» more  MM 2006»
16 years 17 days ago
Motion swarms: video interaction for art in complex environments
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
Quoc Nguyen, Scott Novakowski, Jeffrey E. Boyd, Ch...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
CONCURRENCY
2002
116views more  CONCURRENCY 2002»
15 years 6 months ago
Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
Krzysztof Boryczko, Witold Dzwinel, David A. Yuen
ICC
2007
IEEE
122views Communications» more  ICC 2007»
16 years 28 days ago
Code-Aided ML Ambiguity Resolution
Abstract— This paper deals with code-aided (CA) maximumlikelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to...
Cédric Herzet, Luc Vandendorpe