✦ LIBER ✦

Fast and Efficient Compression of Floating-Point Data

✍ Scribed by Lindstrom, P.; Isenburg, M.

Book ID: 117939511
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 539 KB
Volume: 12
Category: Article
ISSN: 1077-2626
DOI: 10.1109/tvcg.2006.143

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast and efficient lossless data-compr

A fast and efficient lossless data-compression method

✍ Jer Min Jou; Pei-Yin Chen 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 120 KB

Accurate and Efficient Floating Point Su

Accurate and Efficient Floating Point Summation

✍ Demmel, James; Hida, Yozo 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 325 KB

Lossless compression of predicted floati

Lossless compression of predicted floating-point geometry

✍ Martin Isenburg; Peter Lindstrom; Jack Snoeyink 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 582 KB

The size of geometric data sets in scientific and industrial applications is constantly increasing. Storing surface or volume meshes in standard uncompressed formats results in large files that are expensive to store and slow to load and transmit. Scientists and engineers often refrain from using me

Fast Exponentiation Using Data Compressi

Fast Exponentiation Using Data Compression

✍ Yacobi, Yacov 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 213 KB

Effects of input quantization in floatin

Effects of input quantization in floating-point digital pulse compression

✍ Aridgides, A.; Morgan, D. 📂 Article 📅 1985 🏛 IEEE ⚖ 221 KB

Efficient decoding of compressed data

✍ Bassiouni, Mostafa A. ;Mukherjee, Amar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 944 KB

In this article, we discuss the problem of enhancing the speed of Huffman decoding. One viable solution to this problem is the multibit scheme which uses the concept of k-bit trees to decode up to k bits at a time. A linear-time optimal solution for the mapping of 2-bit trees into memory is presente