We used it to display results of Huffman algorithm.
我们用它来显示哈夫曼算法的结果。
Main data includes scale factors and Huffman coded bits.
主数据包括比例系数和霍夫曼编码位。
Huffman tree structure to achieve the Huffman algorithm.
实现构造哈夫曼树的哈夫曼算法。
Should Huffman compression be in strict order of frequency?
该哈夫曼压缩在频率严格的？
Solving the structure of the Huffman tree with the right to use the path length.
求解出所构造的哈夫曼使用树的带权路径长度。
In the Huffman coding based on the decoding, you can restore the compressed data.
在哈夫曼编码的基础上进行解码，就可以还原压缩的数据。
Huffman coding is widely used, such as JPEG in the application of the Huffman coding.
哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。
A float data compression method, based on Huffman coding and for SAR images, is proposed.
提出一种基于霍夫曼编码的SAR浮点图像数据压缩方法。
Lossless compression based on Huffman coding (lossless data compression) and decompression algorithms.
基于Huffman编码的无损压缩(losslessdatacompression)和解压缩算法。
This algorithm is totally different from previous huffman algorithm in the operation process of optimizing binary tree.
该算法在使二叉树达到最优的运算过程中，完全区别于以往的哈夫曼算法。
Teach for America has no official preference for or opposition to any candidate, said Kevin Huffman, a spokesman for the group.
这个团体的发言人凯文·霍夫曼称，为美国而教并不公开支持或反对任何一个候选人。
The more effortless an observation, Huffman believes, the more people can productively tailor their behavior to that information.
Huffman相信，观察的越毫不费力，越多的人能够通过那些信息效率更高的工作。
In 2004, Mr. Huffman had a magnet surgically inserted into his fingertip to study the utility of cochlear implants for the hearing-impaired.
2004年，Huffman先生将一块磁铁外科手术般地植入他的指尖里，来学习了解对于耳障患者人工耳蜗植入技术的应用。
According to our well-established Huffman coding, starting from the root node in the left subtree is marked as 0, the right is labeled 1.
根据建立好的哈夫曼树我们进行编码，从根结点出发在左子树则标为0，右则标为1。
This paper first introduces the common image compression technology-Huffman coding and fractal coding, and then proposes some improvements.
本文通过介绍常见的图像压缩技术——哈夫曼编码和分形编码，提出了一些改进的方法。
The main functions of the procedure is to use Huffman coding lossless compression of data to achieve Huffman compression encoder and decoder.
程序的主要功能是利用哈夫曼编码对数据进行无损压缩，实现Huffman压缩的编码器和译码器。
The gzip compressor is based on the DEFLATE lossless data compression algorithm, which USES a combination of the LZ77 algorithm and Huffman coding.
gzip压缩器基于deflate无损数据压缩算法，它使用LZ77算法和Huffman编码的组合。
The paper proposes two methods for compressing tested pattern, one based on statistical Huffman code, the other based on differential Golomb code.
本文中，给出了2种压缩测试模式的方法，一种是基于统计的哈夫曼编码，一种是基于差分运算的Golomb编码。
The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。
The algorithm uses a fixed set of complementary parity codes to replace the encoding table that dynamically generated by the traditional Huffman method.
该算法使用固定奇偶码，省去了传统算法动态生成哈夫曼树的繁琐过程；
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。
Huffman suggests grouping similar processes together on the same machine or group of machines to avoid context switching all the time which consumes resources.
Huffman建议将类似的进程集中在一台机器或一组机器上，这样可以避免频繁的上下文切换，减少资源消耗。
Summary of design: the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。
In the computer information processing, "Huffman coding" is a consistent coding method (also known as "entropy coding method") for lossless data compression.
在计算机信息处理中，“哈夫曼编码”是一种一致性编码法(又称“熵编码法”)，用于数据的无损耗压缩。
Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
The Huffman WJ-156 Multi-Axis Abrasive Waterjet System provides increased precision, reliability and operating convenience for a wide variety of applications.
多轴磨削水射流系统提供了增强的精度，可靠性和操作方便性。
Test with ECG data, we drew a conclusion following:(1) This algorithm can lossless compress ECG data and yield a high compression ratio than Huffman algorithm.
通过对心电的压缩试验表明：（1）此算法能够有效的对心电数据进行无损压缩，得到比熵编码更好的压缩比；
Considering characters of biomedical signals, the paper proposes the Improved Adaptive Huffman algorithm, a real -time compression algorithm can be used in SCM.
针对生理信号的特点，本文提出了一种能够在多数单片机上使用的实时压缩算法——改进型自适应哈夫曼算法。
Experimental results were compared with Huffman code, and through analyzing, this code method has advantage when probability of gray scale is distributed equally.
其实验结果与哈夫曼编码做了比较，经过分析，此编码方法在灰度级概率均匀分布时具有优势。
Experimental results were compared with Huffman code, and through analyzing, this code method has advantage when probability of gray scale is distributed equally.
其实验结果与哈夫曼编码做了比较，经过分析，此编码方法在灰度级概率均匀分布时具有优势。
应用推荐