Sciweavers

16 search results - page 3 / 4
» The value of redundant measurement in compressed sensing
Sort
View
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 5 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
INFOCOM
2010
IEEE
13 years 4 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
SUTC
2008
IEEE
14 years 4 days ago
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different typ...
Vasanth Iyer, Rammurthy Garimella, M. B. Srinivas
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 5 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
ICASSP
2011
IEEE
12 years 9 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...