Sciweavers

260 search results - page 29 / 52
» Compression of Compound Documents
Sort
View
CIKM
2011
Springer
12 years 6 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
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
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 7 months ago
Compressed Inverted Indexes for In-Memory Search Engines
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 ...
Frederik Transier, Peter Sanders
WWW
2007
ACM
14 years 7 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
ICIP
2003
IEEE
14 years 8 months ago
Approximation of color characterization MLUTS with artificial neural networks
MLUTs used in color characterization require significant memory for embedded systems. Most tools that create device characterization maps, use MLUTs. For this reason, there is int...
Michael J. Vrhel