Results 201 to 210 of about 11,062 (250)

Labeled dataset of X-ray protein ligand images in 3D point cloud and validated deep learning models. [PDF]

Sci Data
Bazzano CF, Alves LFG, Telles GP, Trivella DBB.   +3 more
europepmc   +1 more source

An Efficient Dynamic Data Structure for Haplotype Matching and Compression on Biobank-Scale Data. [PDF]

J Comput Biol
Shakya P, Sanaullah A, Zhi D, Zhang S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Optimal Prefix Codes And Huffman Codes

International Journal of Computer Mathematics, 2003
Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Weijia Jia
exaly   +2 more sources

Prefix code translation by mapping

Journal of Computer Science and Technology, 1994
This paper introduces a new way of prefix code translation. It helps to finish the whole translation by mapping once (only one comparison instruction is needed for getting the length of prefix code), and returns the original data and the length of prefix code element.
exaly   +2 more sources

Decoding prefix codes

Software: Practice and Experience, 2006
1687
Mike Liddell, Alistair Moffat
openaire   +2 more sources

Housekeeping for prefix coding

IEEE Transactions on Communications, 2000
Summary: We consider the problem of constructing and transmitting the prelude for Huffman coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when \(S\), the size of the source alphabet, is of the same magnitude as \(m\), the length of ...
Andrew Turpin, Alistair Moffat
openaire   +1 more source

Partial-prefix synchronizable codes

IEEE Transactions on Information Theory, 2001
Summary: A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere is the frame, a Prefix Synchronizable code (PS-code) is used.
Adriaan J. de Lind van Wijngaarden, Hiroyoshi Morita   +1 more
openaire   +1 more source

Bit Recycling with Prefix Codes

2007 Data Compression Conference (DCC'07), 2007
This paper presents a technique that aims at reducing the expansion of the compressed files that is caused by the multiplicity of equivalent messages. It does not try to eliminate multiplicity. Instead, it takes advantage of multiplicity by converting it into useful information, which we choose to describe parts of the compressed file itself.
Danny Dubé, Vincent Beaudoin
openaire   +1 more source

Strong Prefix Codes of Pictures

2013
A set X ⊆ Σ** of pictures is a code if every picture over Σ is tilable in at most one way with pictures in X. The definition of strong prefix code is introduced and it is proved that the corresponding family of finite strong prefix codes is decidable and it has a polynomial time decoding algorithm.
Anselmo, M, GIAMMARRESI, DORA, Madonia, M.   +2 more
openaire   +3 more sources