Sciweavers

18 search results - page 2 / 4
» Alphabet Partitioning for Compressed Rank Select and Applica...
Sort
View
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 7 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
15 years 10 months ago
Resolution Scalable Coding and Region of Interest Access with Three-Dimensional SBHP Algorithm
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
Ying Liu, William A. Pearlman
ICIP
2005
IEEE
16 years 5 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
139
Voted
CIKM
2011
Springer
14 years 4 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
2006
IEEE
16 years 3 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford