Sciweavers

231 search results - page 6 / 47
» Context Matching for Compressed Terms
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu
DCC
1998
IEEE
13 years 11 months ago
Compression of Unicode Files
The increasing importance of Unicode for text files, for example with Java and in some modern operating systems, implies a possible doubling of data storage space and data transmi...
Peter M. Fenwick, Simon Brierley
DCC
2003
IEEE
14 years 7 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
IGARSS
2009
13 years 5 months ago
Evaluation of JP3D for Lossy and Lossless Compression of Hyperspectral Imagery
The performance of the recent JPEG2000 Part 10 standard, known as JP3D, is evaluated for the lossy and lossless compression of hyperspectral imagery. Experimental results using a ...
Jing Zhang, James E. Fowler, Nicolas H. Younan, Gu...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 7 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li