Sciweavers

250 search results - page 29 / 50
» Reorganizing compressed text
Sort
View
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Error Resilient Multiple Description Coding Based on Wavelet Tree Coding and EREC for Wireless Networks
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
Daewon Song, Lei Cao, Chang Wen Chen
COMPUTER
2000
138views more  COMPUTER 2000»
14 years 9 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
DCC
2011
IEEE
14 years 5 months ago
Improving PPM Algorithm Using Dictionaries
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
Yichuan Hu, Jianzhong (Charlie) Zhang, Farooq Khan...
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 5 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
ACL
1996
14 years 11 months ago
Linguistic Structure as Composition and Perturbation
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...
Carl de Marcken