Sciweavers

229 search results - page 11 / 46
» Semi-Lossless Text Compression
Sort
View
DCC
1998
IEEE
13 years 11 months ago
Lossy Compression of Partially Masked Still Images
Books and magazines often contain pages containing audacious mixtures of color images and text. Our problem consists in coding the background colors of a such documents without wa...
Léon Bottou, Steven Pigeon
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Spam Filtering Using Statistical Data Compression Models
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...
Andrej Bratko, Gordon V. Cormack, Bogdan Filipic, ...
CPM
2010
Springer
146views Combinatorics» more  CPM 2010»
14 years 5 days ago
Parallel and Distributed Compressed Indexes
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
DCC
2010
IEEE
13 years 10 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin