Sciweavers

4616 search results - page 187 / 924
» The Communication Complexity of Correlation
Sort
View
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
16 years 1 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
GLOBECOM
2009
IEEE
16 years 1 months ago
Distributed Joint Source-Channel Coding for Functions over a Multiple Access Channel
—In this paper we provide sufficient conditions for lossy transmission of functions of correlated data over a multiple access channel (MAC). The conditions obtained can be shown...
R. Rajesh, Vinod Sharma
ICC
2009
IEEE
176views Communications» more  ICC 2009»
16 years 1 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
The semantic mapping of words and co-words in contexts
Meaning can be generated when information is related at a systemic level. Such a system can be an observer, but also a discourse, for example, operationalized as a set of document...
Loet Leydesdorff, Kasper Welbers
ICIP
2007
IEEE
16 years 28 days ago
Complexity Control for Real-Time Video Coding
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...
Emrah Akyol, Debargha Mukherjee, Yuxin Liu