93 search results - page 6 / 19 » Fast Searching on Compressed Text Allowing Errors |
VIS
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
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...
SPE
2008
13 years 7 months ago
2008
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
IPM
2011
12 years 11 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...