169 search results - page 12 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
JMLR
2006
13 years 7 months ago
2006
Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade fi...
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
AAAI
2008
13 years 9 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...