Sciweavers

54 search results - page 4 / 11
» Lower Bounds for the Noisy Broadcast Problem
Sort
View
TIT
2011
116views more  TIT 2011»
13 years 21 days ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 23 days ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
13 years 9 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
JMLR
2012
11 years 8 months ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
13 years 11 months ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong