95 search results - page 4 / 19 » Data Compression Using Encrypted Text |
ALENEX
2008
13 years 7 months ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
JMLR
2006
13 years 6 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...
JCP
2006
13 years 6 months ago
2006
Abstract-- The paper details a scheme for lossless compression of short data series larger than 50 Bytes. The method uses arithmetic coding and context modeling with a low-complexi...
SIGIR
1998
ACM
13 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
ICDE
2010
IEEE
14 years 6 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...