Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
IEEE Transactions on Information Theory
IEEE Press
 
   
 
Options:
 
  1-4 of 4 reviews Date Reviewed 
  Information-theoretic caching: sequential coding for computing
Wang C., Lim S., Gastpar M. IEEE Transactions on Information Theory 62(11): 6393-6406, 2016.  Type: Article

Streaming video sequences can be encoded in real time by applying a variable of some average rate of bits per symbol. Such a technique stores both the data sequence and the request sequence simultaneously for updated visual information...

Jun 21 2017
  Blind compressed sensing
Gleichman S., Eldar Y. IEEE Transactions on Information Theory 57(10): 6958-6975, 2011.  Type: Article

One of the big issues in applying compressed sensing to reconstruct a sparse signal is the need to know which basis was used to determine sparsity. The authors of this paper consider the blind case, in which the basis is unknown, and d...

Mar 21 2013
  Robust detection of signals: a large deviations approach
Moustakides G. IEEE Transactions on Information Theory IT-31(6): 822-825, 1985.  Type: Article

The paper concerns the problem of robust detection of signals in the case of independent and identically distributed observations. Using the exponential rate of decrease of the error probability as a performance measure, the author sh...

Jun 1 1988
  Robust multiple-input matched filtering: frequency and time-domain results
Chen C., Kassam S. IEEE Transactions on Information Theory IT-31(6): 812-821, 1985.  Type: Article

This paper is dedicated to the study of the linear filters that maximize the output signal-to-noise ratio, known as matched filters. The authors introduce a robust matched filter, namely the filter that is optimum for a least-favorable...

Jun 1 1987
 
 
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy