On-the-fly decompression and rendering of multiresolution terrain
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Efficient in-memory top-k document retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Variable bit rate GPU texture decompression
EGSR'11 Proceedings of the Twenty-second Eurographics conference on Rendering
HFPaC: GPU friendly height field parallel compression
Geoinformatica
| Hi-index | 0.00 |
In many applications of compression, decoding speed is at least as important as compression effectiveness. For example, the large inverted indexes associated with text retrieval mechanisms are best stored compressed, but a working system must also process queries at high speed. Here we present two coding methods that make use of fixed binary representations. They have all of the consequent benefits in terms of decoding performance, but are also sensitive to localized variations in the source data, and in practice give excellent compression. The methods are validated by applying them to various test data, including the index of an 18 GB document collection.