-
Huffmancoding111123123121
霍夫曼编码的C++实现，含word详细叙述文档，详细注释。(Huffman coding C++ to achieve, including the word detailed description of the documents, detailed notes.)
- 2012-08-13 16:48:36下载
- 积分：1
-
huffman
huffman 编码
完陈对指定的文本文件内容进行huffman编码
实现输出(END CHAN huffman encoding text file on the specified content encoding huffman implementation output)
- 2009-04-03 13:04:43下载
- 积分：1
-
e
说明： 一个上课很好用的课件，是您编程的很好帮手(why)
- 2009-03-27 08:41:54下载
- 积分：1
-
Huffman
用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)
- 2012-06-26 14:52:57下载
- 积分：1
-
lzari压缩算法
这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)
- 2005-03-06 13:01:17下载
- 积分：1
-
hu
说明： 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
(Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.)
- 2008-06-12 12:30:36下载
- 积分：1
-
ZIP
zip压缩源代码，附有整个工程，保证能用，可应用于文件压缩，内存压缩(zip compressed source code, with the whole project, and ensure that use, can be applied to file compression, memory compression)
- 2008-12-15 21:33:12下载
- 积分：1
-
CArcExt_demo
加密、压缩(The Examples of Encrypt and Compression)
- 2021-03-03 08:29:33下载
- 积分：1
-
PhucDo_PhanLop
Docuemtns,Hot Documents
- 2009-12-26 14:25:16下载
- 积分：1
-
FDR-COMPRESS
一种改进的方案，它针对硬故障集的特点利用指示频率连续长度码(FDR码)进行二次编码压缩。该方法充分利用测试集中无关位较多而测试模式之间变化位较少的特征，应用贪心算法对预先计算的测试集进行了重新排序，尽可能的使相邻的向量间具有最少的不同位，排列成一个最佳的差分向量序列，然后应用FDR码对差分向量序列进行编码,最后对压缩结果重新分块，按照一次压缩的流程进行二次压缩。在解压时，使用片上解压电路解压，能高效地还原出原测试集。最后通过对Soc部分标准电路硬故障集的测试结果显示，本方案具有较好的压缩率。(a new improved method was proposed in the paper,the method using Frequency-Directed Run-length(FDR codes)coding for the twice aimed at hard-fault. It fully takes advantage of the characters that there are many don’t-care bits in the test set but a few different bits between the test patterns, Then it applies the greed calculate way to sort the precomputed test sets and make the close together vector have the least different sites possibly. It uses the FDR codes to coding the vectors,then blocks the results and uses the FDR codes to compress for the second time.
Decompression used of on-chip circuit extract unpack,it will be deoxidize the original test efficient.using the hard-fault to compress and the experimental results prove that the improved coding method of this paper has the better compression ratios has been proved at last.
)
- 2009-05-12 14:32:23下载
- 积分：1
