Results 51 to 60 of about 3,671 (229)
High-Speed Architecture for Hybrid Arithmetic–Huffman Data Compression
This paper proposes a hardware–software co-design for adaptive lossless compression based on Hybrid Arithmetic–Huffman Coding, a table-driven approximation of arithmetic coding that preserves near-optimal compression efficiency while eliminating the ...
Yair Wiseman
doaj +1 more source
Investment centre manager's multiperiod fairness perceptions and intertemporal dependency
Abstract This paper explores the motivation of investment centre managers when their investment centre's performance is affected by decisions made by their predecessor. Through a qualitative case study of a Japanese manufacturer, the effectiveness of conventional remedies for motivational issues and further motivational issues caused by the same ...
Hiroyuki Selmes‐Suzuki
wiley +1 more source
Quantum-inspired Huffman Coding
Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable ...
M Z Rashad, A S Tolba, M A El-Dosuky
core
Image compression using Huffman Coding algorithm
Cilj rada je opisati teorijske osnove kompresije slika i kompresije Huffman Coding algoritmom, a nakon toga implementirati Huffman Coding algoritam za kompresiju slika.
Svjetličić, Vilim
core
Huffman coding with unequal letter costs [PDF]
(MATH) In the standard Huffman coding problem, one is given a set of words and for each word a positive frequency. The goal is to encode each word w as a codeword c(w) over a given alphabet. The encoding must be prefix free (no codeword is a prefix of any other) and should minimize the weighted average codeword size Σw freq w, |c(w)|. The problem has a
Mordecai J. Golin +2 more
openaire +2 more sources
Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann +2 more
wiley +1 more source
A Low-Complexity Lossless Compression Method Based on a Code Table for Infrared Images
Traditional JPEG series image compression algorithms have limitations in speed. To improve the storage and transmission of 14-bit/pixel images acquired by infrared line-scan detectors, a novel method is introduced for achieving high-speed and highly ...
Yaohua Zhu +3 more
doaj +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source
Modification of Huffman Coding. [PDF]
Huffman Coding minimizes the average number of coding digits per message. Minimizing the mean time by this method raises the problem of large variance.
Kilic, Suha
core
ABSTRACT This study focuses on the recruitment experiences of transgender and gender‐diverse (T&GD) individuals. Reporting on semi‐structured interviews with 22 T&GD individuals from Australia, the study suggests critical moments occur during the recruitment process for T&GD candidates, contributing to both theory and practice.
Robin C. Ladwig +2 more
wiley +1 more source

