Sciweavers

1098 search results - page 21 / 220
» Compressed web indexes
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 8 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
CN
1999
73views more  CN 1999»
15 years 25 days ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
WWW
2004
ACM
16 years 1 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna
ICIP
2001
IEEE
16 years 2 months ago
Lossy and lossless compression for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color informationhas been developed. Rather than sorting color indexes into a linear list...
Xin Chen, Sam Kwong, Ju-fu Feng
WWW
2003
ACM
16 years 1 months ago
Dynamic maintenance of web indexes using landmarks
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...
Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey...