Results 91 to 100 of about 2,854 (228)
A Data Compression Method for Wellbore Stability Monitoring Based on Deep Autoencoder
The compression method for wellbore trajectory data is crucial for monitoring wellbore stability. However, classical methods like methods based on Huffman coding, compressed sensing, and Differential Pulse Code Modulation (DPCM) suffer from low real-time
Shan Song +3 more
doaj +1 more source
Drying Effect of Landfalling Tropical Cyclones
Abstract The high precipitation efficiency of tropical cyclones (TCs) is theorized to dehydrate the atmosphere, a process with important climate implications that has yet to be confirmed by direct observational evidence. Using satellite and reanalysis data, this study statistically examines the drying effect of landfalling TCs. Results indicate a local
Yazhu Yang +4 more
wiley +1 more source
An efficient chain code with Huffman coding
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes
Liu, Yong Kui, Žalik, Borut
core
Abstract The floods of 01 September 2009 in Ouagadougou, Burkina Faso, were among the most severe in the Central Sahel's history, highlighting the region's persistent flood risk. This extreme precipitation event (EPE) was influenced by various atmospheric drivers, including Convectively Coupled Equatorial Waves (CCEWs).
Moussa Diakhaté +4 more
wiley +1 more source
Analisis dan Implementasi Optimasi Performansi Algoritma Huffman Code pada Kompresi data text Menggunakan Algoritma Move-To-Front Code dan Transformasi Burrows-Wheeler [PDF]
Perkembangan teknologi informasi didukung dengan majunya teknologi penyimpanan file berupa hardware yang semakin canggih saat ini terkadang masih belum mampu mengimbangi ukuran dari data yang semakin besar menyebabkan data dan informasi banyak yang tidak
Arief Fardillah
core
Huffman algebras for independent random variables
[[abstract]]The Huffman algorithm was originally devised to construct the minimal expected length instantaneous source code for a random variable. In this paper, we identify the Hardy-Littlewood-Polya inequality as the key step in the proof of the ...
Chang, Cheng-Shang;Thomas, Joy A.
core +1 more source
Bidirectional Huffman Coding [PDF]
Aviezri S. Fraenkel, Shmuel T. Klein
openaire +1 more source
Region based Huffman (RBH) compression technique with code interchange
There were few research works are continuing to increase the performance of Huffman coding. The proposed paper is based on the new technique region based Huffman to increase the performance of the Huffman coding.
master administrator
core
LEMPEL - ZIV - WELCH & HUFFMAN” - THE LOSSLESS COMPRESSION TECHNIQUES; (IMPLEMENTATION ANALYSIS AND COMPARISON THEREOF) [PDF]
This paper is about the Implementation Analysis and Comparison of Lossless Compression Techniques viz. Lempel-Ziv-Welch and Huffman. LZW technique assigns fixed length code words.
Kapil Kapoor*, Dr. Abhay Sharma
core +1 more source
Estimating the size of Huffman code preambles
Data compression via block-adaptive Huffman coding is considered. The compressor consecutively processes blocks of N data symbols, estimates source statistics by computing the relative frequencies of each source symbol in the block, and then synthesizes ...
Mceliece, R. J., Palmatier, T. H.
core +1 more source

