Distributed sparse random projections for refinable approximation

IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks

Volumn , Issue , 2007, Pages 331-339

  Wang, Wei ^a   Garofalakis, Minos ^b   Ramchandran, Kannan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

AMS sketching; Compressed sensing; Refinable approximation; Sparse random projections; Wireless sensor networks

Indexed keywords

AMS SKETCHING; COMPRESSED SENSING; REFINABLE APPROXIMATION; SPARSE RANDOM PROJECTIONS;

ALGORITHMS; APPROXIMATION THEORY; DATA COMPRESSION; DISTRIBUTED COMPUTER SYSTEMS; ERROR ANALYSIS; PROBLEM SOLVING; QUERY PROCESSING;

WIRELESS SENSOR NETWORKS;

EID: 35348850242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1236360.1236403     Document Type: Conference Paper

References (21)

1. E. Candes and T. Tao. Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies. IEEE Transactions on Information Theory, 52(12), pp. 5406-5425, December 2006.
2. D. Donoho. Compressed Sensing. IEEE Transactions on Information Theory, 52(4), pp. 1289-1306, April 2006.
3. http://www.dsp.ece.rice.edu/CS/
4. M. Rabbat, J. Haupt, A. Singh, and R. Nowak. Decentralized Compression and Predistribution via, Randomized Gossiping. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006.
5. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak. Compressive Wireless Sensing. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006.
6. D. Baron, M.F. Duarte, S. Sarvotham, M.B. Wakin, and R:. Baraniuk. An Information-Theoretic Approach to Distributed Compressed Sensing. Proceedings of the 43rd Allerton Conference on Communication, Control, and Computing, 2005.
7. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proceedings of the ACM Symposium on Theory of Computing (STOC), 1996.
8. A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M.J. Strauss. One-Pass Wavelet Decompositions of Data Streams. IEEE Transactions on Knowledge and Data Engineering, 15(3), pp. 541-554, May 2003.
9. G. Cormode, M. Garofalakis, and D. Sacharidis. Fast Approximate Wavelet Tracking on Streams. Proceedings of the International Conference on Extending Database Technology (EDBT), 2006.
10. W.B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hubert space. Proceedings of the Conference in Modern Analysis and Probability, 1984.
11. D. Achlioptas. Database-friendly random projections: Johnson- Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4), pp. 671-687, 2003.
12. P. Li, T.J. Hastie, and K.W. Church. Very Sparse Random Projections. Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD), 2006.
13. N. Ailon and B. Chazelle. Approximate Nearest Neighbors and the Fast Johnson-Lindenstrauss Transform. Proceedings of the ACM Symposium on Theory of Computing (STOC), 2006.
14. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, NY, 1985.
15. M. Vetterli and J. Kovačević. Wavelets and Subband Coding. Prentice Hall, Englewood Cliffs, NJ, 1995.
16. S. Mallat. A Wavelet Tour of Signal Processing. Academic Press, San Diego, CA, 1999.
17. M. Penrose. Random Geometric Graphs. Oxford University Press, UK, 2003.
18. W. Wang and K. Ramchandran. Random Distributed Multiresolution Representations with Significance Querying. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2006.
19. A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous Access to Distributed Data in Large-Seals Sensor Networks through Decentralized Erasure Codes. Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN), 2005.
20. R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.
21. M. Luby. LT Codes. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002.