Sciweavers

677 search results - page 130 / 136
» On the reconstruction of perfect codes
Sort
View
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 7 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
SENSYS
2003
ACM
14 years 2 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
IEICET
2007
83views more  IEICET 2007»
13 years 9 months ago
A MFCC-Based CELP Speech Coder for Server-Based Speech Recognition in Network Environments
Existing standard speech coders can provide speech communication of high quality while they degrade the performance of speech recognition systems that use the reconstructed speech...
Jae Sam Yoon, Gil Ho Lee, Hong Kook Kim
NECO
2007
127views more  NECO 2007»
13 years 9 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
PERCOM
2010
ACM
13 years 8 months ago
Resilient image sensor networks in lossy channels using compressed sensing
—Data loss in wireless communications greatly affects the reconstruction quality of a signal. In the case of images, data loss results in a reduction in quality of the received i...
Scott Pudlewski, Arvind Prasanna, Tommaso Melodia