-
SAMPpackage
compresive sampling matching pursuit
- 2020-12-18 13:19:11下载
- 积分:1
-
JPEG-DCT
JPEG压缩核心变换DCT实现源码,用matlab7.0实现(JPEG compression core transform DCT achieve source used to achieve matlab7.0)
- 2006-12-18 09:35: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
-
lzw_soft
lzw压缩解压算法源码(The soruce of LZW compression algorithm)
- 2020-06-26 13:00:01下载
- 积分:1
-
万年历-c
用C语言编的万年历(C language series hefty almanac)
- 2020-06-26 09:00:01下载
- 积分:1
-
HAFUMANSHU
哈夫曼编码(Huffman Coding),又称霍夫曼编码,是一种编码方式,哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法,该方法完全依据字符出现概率来构造异字头的平均长度最短的码字,有时称之为最佳编码,一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)
- 2016-12-13 00:02:52下载
- 积分:1
-
hmm
连续隐马尔可夫模型hmm的matlab程序(Continuous Hidden Markov Model of matlab procedures hmm)
- 2020-06-29 19:00:02下载
- 积分:1
-
bin
说明: 传统游程编码,并且又对游程编码进行了一定程度的改进。(The traditional run-length coding has improved it to some extent.)
- 2020-06-24 19:40:01下载
- 积分:1
-
HuffMan
哈夫曼编码译码系统,设置发送者和接受者两个功能,
发送者的功能包括:
①输入待传送的字符信息;
②统计字符信息中出现的字符种类数和各字符出现的次数(频率);
②根据字符的种类数和各自出现的次数建立哈夫曼树;
③利用以上哈夫曼树求出各字符的哈夫曼编码;
④将字符信息转换成对应的编码信息进行传送。
接受者的功能包括:
①接收发送者传送来的编码信息;
②利用上述哈夫曼树对编码信息进行翻译,即将编码信息还原成发送前的字符信息。
(Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)
- 2012-06-21 21:01:17下载
- 积分:1
-
zip
quitar de claves de winzip
- 2019-05-26 07:14:19下载
- 积分:1