Sciweavers

469 search results - page 46 / 94
» On Compressing the Textual Web
Sort
View
EXPERT
2008
134views more  EXPERT 2008»
14 years 12 months ago
Learning to Tag and Tagging to Learn: A Case Study on Wikipedia
Natural language technologies have been long envisioned to play a crucial role in transitioning from the current Web to a more "semantic" Web. If anything, the significa...
Peter Mika, Massimiliano Ciaramita, Hugo Zaragoza,...
SPIRE
2005
Springer
15 years 5 months ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna
TON
2002
175views more  TON 2002»
14 years 11 months ago
Compressed bloom filters
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...
Michael Mitzenmacher
DCC
2000
IEEE
15 years 4 months ago
QccPack: An Open-Source Software Library for Quantization, Compression, and Coding
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...
James E. Fowler
CIKM
2011
Springer
13 years 12 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, ...