Sciweavers

64 search results - page 12 / 13
» The Shannon Capacity of a Union
Sort
View
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 1 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
ACL
1998
13 years 9 months ago
Processing Unknown Words in HPSG
The lexical acquisition system presented in this paper incrementallyupdates linguisticproperties of unknown words inferred from their surrounding context by parsing sentences with...
Petra Barg, Markus Walther
NAR
2007
81views more  NAR 2007»
13 years 7 months ago
Pseudogene.org: a comprehensive database and comparison platform for pseudogene annotation
The Pseudogene.org database serves as a comprehensive repository for pseudogene sequence annotation. The definition of a pseudogene varies within the literature, resulting in sign...
John E. Karro, Yangpan Yan, Deyou Zheng, Zhaolei Z...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
WCNC
2008
IEEE
14 years 2 months ago
Three-Stage Serially Concatenated Codes and Iterative Center-Shifting K-Best Sphere Detection for SDM-OFDM: An EXIT Chart Aided
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo