Sciweavers

3818 search results - page 57 / 764
» Word Problems on Compressed Words
Sort
View
DATESO
2007
134views Database» more  DATESO 2007»
15 years 5 months ago
Genetic Algorithms in Syllable-Based Text Compression
Abstract. Syllable based text compression is a new approach to compression by symbols. In this concept syllables are used as the compression symbols instead of the more common char...
Tomas Kuthan, Jan Lansky
COMPSAC
2002
IEEE
15 years 9 months ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
CRYPTO
2008
Springer
70views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...
Phillip Rogaway, John P. Steinberger
KES
2005
Springer
15 years 10 months ago
Learning Method for Automatic Acquisition of Translation Knowledge
This paper presents a new learning method for automatic acquisition of translation knowledge from parallel corpora. We apply this learning method to automatic extraction of bilingu...
Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi
ACL
1998
15 years 5 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber