Sciweavers

273 search results - page 10 / 55
» Compressed String Dictionaries
Sort
View
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
CBMS
2007
IEEE
14 years 2 months ago
Influence of Dictionary Size on the Lossless Compression of Microarray Images
A key challenge in the management of microarray data is the large size of images that constitute the output of microarray experiments. Therefore, only the expression values extrac...
Robert Bierman, Rahul Singh
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ITCC
2003
IEEE
14 years 29 days ago
Dictionary-Based Fast Transform for Text Compression
In this paper we present StarNT, a dictionary-based fast lossless text transform algorithm. With a static generic dictionary, StarNT achieves a superior compression ratio than alm...
Weifeng Sun, Nan Zhang 0005, Amar Mukherjee
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
14 years 29 days ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty