Results 161 to 170 of about 2,484,228 (241)

Simultaneous optimized orthogonal matching pursuit with application to ECG compression. [PDF]

PLoS One
Rebollo-Neira L.
europepmc   +1 more source

Optimising time-limited trials in acute respiratory failure: a multicentre focused ethnography protocol. [PDF]

BMJ Open
Kruser JM, Wiegmann DA, Nadig NR, Secunda KE, Hanlon BM, Moy JX, Ahmad A, Campbell EG, Donnelly HK, Martinez FJ, Polley M, Orhan C, Korth E, Stalter LN, Rowe TJ, Wu AL, Viglianti EM, Eisinger EC, Nguyen O, Halpern SD, Clapp JT.   +20 more
europepmc   +1 more source

Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers. [PDF]

Entropy (Basel)
Deylam Salehi MR, Malak D.
europepmc   +1 more source

Delivering guideline-directed medical therapy for heart failure with reduced ejection fraction as an over-encapsulated polypill: rationale and protocol for the COMBO-HF-X pilot crossover randomised clinical trial. [PDF]

BMJ Open
DeJong C, Durstenfeld MS, Davis JD, Wang CS, Riley ED, Huffman MD, Hickey MD, Shade SB, Chen JC, Kazi DS, Grochowski J, Steward WT, Zier LS, Moreau N, Sandhu AT, Heidenreich PA, Agarwal A, Hsue PY.   +17 more
europepmc   +1 more source

Learning-based short text compression using BERT models. [PDF]

PeerJ Comput Sci
Öztürk E, Mesut A.
europepmc   +1 more source

A 2-year calorie restriction intervention may reduce glycomic biological age biomarkers - a pilot study. [PDF]

NPJ Aging
Pribić T, Das JK, Đerek L, Belsky DW, Orenduff M, Huffman KM, Kraus WE, Deriš H, Šimunović J, Štambuk T, Frkatović-Hodžić A, Kraus VB, Das SK, Racette SB, Banskota N, Ferrucci L, Pieper C, Lewis NE, Lauc G, Krishnan S.   +19 more
europepmc   +1 more source

Harnessing the Power of Pre-Trained Models for Efficient Semantic Communication of Text and Images. [PDF]

Entropy (Basel)
Kutay E, Yener A.
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

Fast Huffman code processing

, 1999
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Huffman Coding

ACM Computing Surveys, 2014
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques.
Alistair Moffat
openaire   +3 more sources