Results 31 to 40 of about 1,245 (171)

Optimal Prefix Free Codes with Partial Sorting

Algorithms, 2019
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O ( n ( 1 + lg α ) ) ⊆ O ( n lg n ) , where the alternation α ∈ [ 1 . .
Jérémy Barbay
doaj   +1 more source

Gendered Pathways to Work–Family Balance and Their Consequences: Insights From Dual‐Career Faculty Couples

Human Resource Development Quarterly, EarlyView.
ABSTRACT This study examines gendered work–family balance (WFB) experiences among dual‐career academic couples at U.S. research‐intensive universities. By comparing faculty couples who shared the same or similar professional and family contexts, the study explores how gendered demands, challenges, resources, and strategies shaped distinct WFB outcomes.
Kyung Nam Kim, Shinhee Jeong
wiley   +1 more source

An efficient chain code with Huffman coding

Pattern Recognition, 2005
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 differ importantly. Therefore, the Huffman coding was applied.
Liu, Yong Kui, Žalik, Borut
openaire   +2 more sources

Huffman Coding with Non-sorted Frequencies [PDF]

Data Compression Conference (dcc 2008), 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein, Dana Shapira
openaire   +2 more sources

The relationship between equatorial wave interaction and heavy rainfall in Southeast Asia

Quarterly Journal of the Royal Meteorological Society, EarlyView.
This study examines the statistical relationship between co‐occurring equatorial waves and heavy rainfall in Southeast Asia. Heavy rainfall is more closely related to combined wave activity than to individual waves in many regions of Southeast Asia. The figure shows GPM–IMERG rainfall (shading) and ERA5 850‐hPa winds (vectors) composited on days when ...
Samantha Ferrett, John Methven, Oscar Martinez‐Alvarado, Xiangbo Feng, Thomas H. A. Frame, Christopher E. Holloway, Steven J. Woolnough, Gui‐Ying Yang   +7 more
wiley   +1 more source

HuffmanEncoder: Una aplicación informática para codificar mensajes por el método de Huffman

Ciencia & Futuro, 2014
El artículo introduce la aplicación informática HuffmanEncoder, que implementa el algoritmo de Huffman, un algoritmo para construir códigos de Huffman, creado por David Huffman en 1952 y descrito en "A Method for the Construction of Minimum-Redundancy ...
Carlos E. Velázquez-Rodríguez
doaj  

Lossless Compression and Data Transformation Techniques on QR Code Binary Bit Stream

IEEE Access
This paper presents a dataset-level evaluation of six lossless compression and data transformation techniques applied to visual-cryptographic (VC) shares derived from QR codes.
Fatoumatta Conteh, Abdullahi Abubakar Imam, Ganesh Kumar, Daphne Teck Ching Lai, Rosyzie Anna Apong, Luiz Fernando Capretz   +5 more
doaj   +1 more source

Robust steganographic framework for securing sensitive healthcare data of telemedicine using convolutional neural network

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract Data is the key element that runs the modern society. Large amounts of data are being released day by day as a result of many activities. The digital data is transferred through the Internet which may be vulnerable to attacks while transmitting. Especially, the medical data is observed to be of at most importance.
Rupa Ch, Venkayya Yadlapalli, Suhana Sulthana Sk, G. Thippa Reddy, Sandeep Kautish   +4 more
wiley   +1 more source

A Simple Binary Run-Length Compression Technique for Non-Binary Sources Based on Source Mapping

Active and Passive Electronic Components, 2001
In this paper, we propose a very simple and efficient binary run-length compression technique for non-binary sources. The technique is based on mapping the non-binary information source into an equivalent binary source using a new fixed-length code ...
Abdel-Rahman Jaradat, Mansour I. Irshid
doaj   +1 more source

The Renyi redundancy of generalized Huffman codes [PDF]

IEEE Transactions on Information Theory, 1988
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes ...
Blumer, Anselm C., McEliece, Robert J.
openaire   +3 more sources