Sciweavers

453 search results - page 17 / 91
» On the complexity of exchanging
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 8 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
GLOBECOM
2008
IEEE
15 years 10 months ago
Near-Capacity Three-Stage Downlink Iteratively Decoded Generalized Layered Space-Time Coding with Low Complexity
Abstract— This paper presents a low complexity iteratively detected space-time transmission architecture based on Generalized Layered Space-Time (GLST) codes and IRregular Convol...
Lingkun Kong, Soon Xin Ng, Lajos Hanzo
MOBIHOC
2008
ACM
16 years 3 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
CISS
2007
IEEE
15 years 10 months ago
High-Throughput Cooperative Communications with Complex Field Network Coding
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
Tairan Wang, Georgios B. Giannakis
ACMSE
2005
ACM
15 years 9 months ago
Reducing application code complexity with vocabulary-specific XML language bindings
The eXtensible Markup Language (XML) has become a ubiquitous data exchange and storage format. A variety of tools are available for incorporating XML-based data into applications....
Jules White, Boris Kolpackov, Balachandran Nataraj...