Sciweavers

273 search results - page 34 / 55
» Compressed String Dictionaries
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
13 years 7 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
Ulrich Lauther, Tamás Lukovszki
CORR
1998
Springer
113views Education» more  CORR 1998»
13 years 7 months ago
Letter to Sound Rules for Accented Lexicon Compression
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
V. Pagel, Kevin Lenzo, Alan W. Black
DCC
2008
IEEE
14 years 2 months ago
Adaptive Compression of Graph Structured Text
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
John Gilbert, David M. Abrahamson
DAWAK
2007
Springer
13 years 11 months ago
An Efficient Algorithm for Identifying the Most Contributory Substring
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
Ben Stephenson