Results 151 to 160 of about 53,193 (208)

Trends in Epidemiology and Treatment of Humerus Fractures in the United States, 2017-2022. [PDF]

Cureus
Ghayyad K, Beaudoin TF, Osbahr DC, Huffman GR, Kachooei AR.   +4 more
europepmc   +1 more source

Adaptive Compression and Reconstruction for Multidimensional Medical Image Data: A Hybrid Algorithm for Enhanced Image Quality. [PDF]

J Imaging Inform Med
David PF, Kothandapani SD, Pugalendhi GK.   +2 more
europepmc   +1 more source

Efficient Data Management in Agricultural IoT: Compression, Security, and MQTT Protocol Analysis. [PDF]

Sensors (Basel)
Has M, Kreković D, Kušek M, Podnar Žarko I.   +3 more
europepmc   +1 more source

Multi-carrier information hiding based on projection-driven vertex embedding in 3D models. [PDF]

PLoS One
Ou Y, Ke J, Yang M, Chen H, Dan Z, Zhao C.   +5 more
europepmc   +1 more source

Deep Compressed Communication and Application in Multi-Robot 2D-Lidar SLAM: An Intelligent Huffman Algorithm. [PDF]

Sensors (Basel)
Zhang L, Deng J.
europepmc   +1 more source

Applying Large Language Models to Assess Quality of Care: Monitoring ADHD Medication Side Effects. [PDF]

Pediatrics
Bannett Y, Gunturkun F, Pillai M, Herrmann JE, Luo I, Huffman LC, Feldman HM.   +6 more
europepmc   +1 more source

Composite Mapping for Peptide-Based Data Storage with Higher Coding Density and Fewer Synthesis Cycles. [PDF]

Adv Sci (Weinh)
Zhang A, Wang L, Zhai X, Xiao Y, Wu Y, Zhao Y, Liu K, Zheng JS, Chen D.   +8 more
europepmc   +1 more source

Deposition of metal-organic frameworks within a porous protein crystal superstructure.

J Mater Chem B
DeRoo JB, Shrestha R, Jones A, Rajendran D, Thai JE, Tuttle RR, Snow CD, Reynolds MM.   +7 more
europepmc   +1 more source

Fast Huffman code processing

, 1999
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Dynamic huffman coding

Journal of Algorithms, 1985
This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with nonnegative integer weights can be represented in such a way that any weight w at level l can be increased or decreased by unity in O(l) steps, preserving minimality of the weighted path length.
openaire   +1 more source