Sciweavers

3818 search results - page 2 / 764
» Word Problems on Compressed Words
Sort
View
DCC
1992
IEEE
13 years 10 months ago
Constructing Word-Based Text Compression Algorithms
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
R. Nigel Horspool, Gordon V. Cormack
LATA
2010
Springer
14 years 1 months ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
EDBT
2010
ACM
392views Database» more  EDBT 2010»
14 years 23 days ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
FCT
1991
Springer
13 years 9 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
COLING
2002
13 years 6 months ago
Applying an NVEF Word-Pair Identifier to the Chinese Syllable-to-Word Conversion Problem
Syllable-to-word (STW) conversion is important in Chinese phonetic input methods and speech recognition. There are two major problems in the STW conversion: (1) resolving the ambi...
Jia-Lin Tsai, Wen-Lian Hsu