Sciweavers

1567 search results - page 11 / 314
» Compressing Relations and Indexes
Sort
View
WWW
2007
ACM
14 years 8 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
DCC
2007
IEEE
14 years 2 months ago
Data Hiding based Compression Mechanism for 3D Models
: The paper proposes a lossy compression mechanism for 3D models (3D meshes) by improving existing compression mechanism such as progressive meshes and single refinement mesh compr...
Hui Li, Parag Agarwal, Balakrishnan Prabhakaran
STACS
2009
Springer
14 years 2 months ago
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. ...
ADC
2004
Springer
116views Database» more  ADC 2004»
14 years 1 months ago
Index Compression Using Fixed Binary Codewords
Document retrieval and web search engines index large quantities of text. The static costs associated with storing the index can be traded against dynamic costs associated with us...
Vo Ngoc Anh, Alistair Moffat
CGF
2010
174views more  CGF 2010»
13 years 7 months ago
Bidirectional Texture Function Compression Based on Multi-Level Vector Quantization
The Bidirectional Texture Function (BTF) is becoming widely used for accurate representation of real-world material appearance. In this paper a novel BTF compression model is prop...
Vlastimil Havran, J. Filip, Karol Myszkowski