Sciweavers

501 search results - page 23 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
ADCM
2008
112views more  ADCM 2008»
13 years 9 months ago
Frames in spaces with finite rate of innovation
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
Qiyu Sun
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 27 days ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ALT
2011
Springer
12 years 8 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
ICC
2007
IEEE
164views Communications» more  ICC 2007»
14 years 3 months ago
Communication Limits with Low Precision Analog-to-Digital Conversion at the Receiver
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
GLOBECOM
2007
IEEE
14 years 3 months ago
A Simple Multiuser and Single-User Dual-Mode Downlink System with Limited Feedback
— Limited feedback systems that simultaneously transmit to multiple users are noise power limited at low SNR and interference power limited at high SNR. Specifically, there is a...
Chun Kin Au-Yeung, Seung Young Park, David James L...