5348 search results - page 55 / 1070 » Models for the Compressible Web |
TON
2002
14 years 9 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
115
click to vote
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Images are often compressed using JPEG or JPEG2000. Many retrieval systems operated in either uncompressed or compressed domains have been proposed. However, retrieving in multipl...
TMM
2002
14 years 9 months ago
2002
Most image and video compression algorithms that have been proposed to improve picture quality relative to compression efficiency have either been designed based on objective crite...
DCC
2000
IEEE
15 years 2 months ago
2000
IEEE
We describe the QccPack software package, an open-source collection of library routines and utility programs for quantization, compression, and coding of data. QccPack is being wr...
CIKM
2011
Springer
13 years 10 months ago
2011
Springer
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...