Sciweavers

273 search results - page 16 / 55
» Compressed String Dictionaries
Sort
View
JCIT
2010
115views more  JCIT 2010»
13 years 2 months ago
The Recognition Method of Unknown Chinese Words in Fragments Based on Mutual Information
This paper presents a method of using mutual information to improve the recognition algorithm of unknown Chinese words, it can resolve the complexity of weight settings and the in...
Qian Zhu, Xian-Yi Cheng, Zi-juan Gao
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
14 years 4 hour ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 1 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
TIT
2010
61views Education» more  TIT 2010»
13 years 2 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
ISMB
1998
13 years 9 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix