Sciweavers

574 search results - page 10 / 115
» Sequential Compressed Sensing
Sort
View
ECML
2006
Springer
13 years 11 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
AAAI
2007
13 years 10 months ago
Learn to Compress and Restore Sequential Data
Yi Wang, Jianhua Feng, Shi-Xia Liu
DCC
2003
IEEE
14 years 7 months ago
Performance of universal codes over infinite alphabets
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
Alon Orlitsky, Narayana P. Santhanam
ICASSP
2008
IEEE
14 years 2 months ago
Iteratively reweighted algorithms for compressive sensing
The theory of compressive sensing has shown that sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. In [1], it was sho...
Rick Chartrand, Wotao Yin
TIT
2011
120views more  TIT 2011»
13 years 2 months ago
Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
—In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar m × n RIP f...
Arash Amini, Farokh Marvasti