A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
The wavelet trie: maintaining an indexed sequence of strings in compressed space
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
LePrEF: Learn to precompute evidence fusion for efficient query evaluation
Journal of the American Society for Information Science and Technology
MapReduce indexing strategies: Studying scalability and efficiency
Information Processing and Management: an International Journal
To index or not to index: time-space trade-offs in search engines with positional ranking functions
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Learning to predict response times for online query scheduling
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Simple Random Access Compression
Fundamenta Informaticae
Variable bit rate GPU texture decompression
EGSR'11 Proceedings of the Twenty-second Eurographics conference on Rendering
A point-based system for local and remote exploration of dense 3D scanned models
VAST'09 Proceedings of the 10th International conference on Virtual Reality, Archaeology and Cultural Heritage
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
Second Chance: A Hybrid Approach for Dynamic Result Caching and Prefetching in Search Engines
ACM Transactions on the Web (TWEB)
Re-Ordered FEGC and Block Based FEGC for Inverted File Compression
International Journal of Information Retrieval Research
Cybernetics and Systems Analysis
Using rating matrix compression techniques to speed up collaborative recommendations
Information Retrieval
Hi-index | 754.84 |
Countable prefix codeword sets are constructed with the universal property that assigning messages in order of decreasing probability to codewords in order of increasing length gives an average code-word length, for any message set with positive entropy, less than a constant times the optimal average codeword length for that source. Some of the sets also have the asymptotically optimal property that the ratio of average codeword length to entropy approaches one uniformly as entropy increases. An application is the construction of a uniformly universal sequence of codes for countable memoryless sources, in which thenth code has a ratio of average codeword length to source rate bounded by a function ofnfor all sources with positive rate; the bound is less than two forn = 0and approaches one asnincreases.