Sciweavers

184 search results - page 25 / 37
» Query Complexity Lower Bounds for Reconstruction of Codes
Sort
View
SLSFS
2005
Springer
14 years 1 months ago
Auxiliary Variational Information Maximization for Dimensionality Reduction
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
Felix V. Agakov, David Barber
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
13 years 10 months ago
Simple coding for achieving mean square stability over bit-rate limited channels
The problem of characterizing lower bounds on data-rates needed for closed loop stability has been solved in a variety of settings. However, the available results lead to coding s...
Eduardo I. Silva, Milan S. Derpich, Jan Øst...
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
CISS
2011
IEEE
12 years 11 months ago
Noncoherent compressive sensing with application to distributed radar
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
Christian R. Berger, Josee M. F. Moura
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 8 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus