Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
137
Energy Aware Lossless Data Compression
- MOBISYS 2003
, 2003
"... Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to reduce the number of bits transmitted. If the energy required to compress data is less than the energy required to send it, ..."
Abstract
-
Cited by 88 (0 self)
- Add to MetaCart
with a system using a single optimized application for both compression and decompression, the asymmetric scheme saves 11% or 12% of the total energy depending on the dataset.
Real time compression of triangle mesh connectivity
- SIGGRAPH 98 Conference Proceedings, Annual Conference Series
, 1998
"... In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known gl ..."
Abstract
-
Cited by 198 (11 self)
- Add to MetaCart
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known
Fast Lossless Compression of Scientific Floating-Point Data
- Proc. Data Compression Conf. (DCC ’06
, 2006
"... In scientific computing environments, large amounts of floating-point data often need to be transferred between computers as well as to and from storage devices. Compression can reduce the number of bits that need to be transferred and stored. However, the runtime overhead due to compression may be ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
be undesirable in high-performance settings where short communication latencies and high bandwidths are essential. This paper describes and evaluates a new compression algorithm that is tailored to such environments. It typically compresses numeric floating-point values better and faster than other algorithms do
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
"... 3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression method is critical to store, process and transmit them. To achieve a high compression rate, most of the existing volume com ..."
Abstract
- Add to MetaCart
reduced using a novel binning algorithm. Our compression method is designed for performance-critical digital brain atlas applications, which often require very fast data access without prior decompression and for which a modest compression rate is acceptable.
Wavelet-based lossless compression scheme with progressive transmission capability
- International Journal of Imaging Systems and Technology
, 1999
"... ABSTRACT: Lossless image compression with progressive transmission capabilities plays a key role in measurement applications, requiring quantitative analysis and involving large sets of images. This work proposes a wavelet-based compression scheme that is able to operate in the lossless mode. The qu ..."
Abstract
-
Cited by 17 (9 self)
- Add to MetaCart
ABSTRACT: Lossless image compression with progressive transmission capabilities plays a key role in measurement applications, requiring quantitative analysis and involving large sets of images. This work proposes a wavelet-based compression scheme that is able to operate in the lossless mode
Implementation of LZW Algorithm for Binary Lossless Data Compression
"... Abstract- When high-speed media or channels are used, high-speed data compression is desired. Software implementations are often not fast enough. In this paper, we present the very high speed hardware description language (VHDL) modeling environment ofLempel-Ziv-Welch (LZW) algorithm for binary data ..."
Abstract
- Add to MetaCart
Abstract- When high-speed media or channels are used, high-speed data compression is desired. Software implementations are often not fast enough. In this paper, we present the very high speed hardware description language (VHDL) modeling environment ofLempel-Ziv-Welch (LZW) algorithm for binary
CCSDS Lossless Data Compression Algorithm in FPGA for Space Applications
"... Abstract—Lossless data compression has been suggested for many space science exploration mission applications either to increase the science return or to reduce the requirement for on-board memory, station contact time, and data archival volume. This paper presents a study and implementation of a lo ..."
Abstract
- Add to MetaCart
Abstract—Lossless data compression has been suggested for many space science exploration mission applications either to increase the science return or to reduce the requirement for on-board memory, station contact time, and data archival volume. This paper presents a study and implementation of a
Band Selection for Lossless Image Compression1
"... Lossless compression algorithms typically do not use spectral prediction, and typical algorithms that do, use only one adjacent band. Using one adjacent band has the disadvantage that if the last band compressed is needed, all previous bands must be decompressed. One way to avoid this is to use a fe ..."
Abstract
- Add to MetaCart
Lossless compression algorithms typically do not use spectral prediction, and typical algorithms that do, use only one adjacent band. Using one adjacent band has the disadvantage that if the last band compressed is needed, all previous bands must be decompressed. One way to avoid this is to use a
Engineering a lightweight suffix array construction algorithm (Extended Abstract)
"... In this paper we consider the problem of computing the suffix array of a text T [1, n]. This problem consists in sorting the suffixes of T in lexicographic order. The suffix array [16] (or pat array [9]) is a simple, easy to code, and elegant data structure used for several fundamental string matchi ..."
Abstract
-
Cited by 81 (3 self)
- Add to MetaCart
to user queries in web-search engines [22]. In all these applications the construction of the suffix array is the computational bottleneck both in time and space. This motivated our interest in designing yet another suffix array construction algorithm which is fast and "lightweight" in the sense
Fast and Lightweight LCP-Array Construction Algorithms
"... The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data st ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data
Results 1 - 10
of
137
