-
建立完整的赫夫曼树，及各种操作，其数据方法，为字母加空格...
建立完整的赫夫曼树，及各种操作，其数据方法，为字母加空格-The establishment of a complete Huffman tree, and a variety of operations, methods of its data for the letter spaces
- 2022-02-21 04:47:24下载
- 积分：1
-
实现对字符的赫夫曼编码，译码，运用栈存储少量字符数据
实现对字符的赫夫曼编码，译码，运用栈存储少量字符数据-Realize the characters Huffman encoding, decoding, using a small amount of character data storage stack
- 2022-06-29 13:15:37下载
- 积分：1
-
important for cs fuculity
important for cs fuculity
- 2022-01-26 08:10:37下载
- 积分：1
-
gif图像的编解码实现，在vc环境下直接编译即可！
gif图像的编解码实现，在vc环境下直接编译即可！-realization of gif graphic compression/decompression,which can be compiled in VC environment.
- 2022-02-09 23:49:40下载
- 积分：1
-
自己编写的一个简单的C语言实现的HUFFMAN编码实现的小程序，适合初学者。...
自己编写的一个简单的C语言实现的HUFFMAN编码实现的小程序，适合初学者。-I have written a simple C-language implementation of HUFFMAN coding a small program, suitable for beginners.
- 2022-07-20 03:36:57下载
- 积分：1
-
ZPAV (H265) pnxNNNN (PHILIPS) demo ZPAV (H265) is audio
ZPAV (H265) pnxNNNN(PHILIPS) demo
ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4,
ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ......
ZPAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，
ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，......
-ZPAV (H265) pnxNNNN (PHILIPS) demo ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV ( H265) is the audio and video compression decompression agreements, very different from the H264/MPEG4, ZPAV (H265) the basic algorithm is a wavelet, multi-level tree collection groups, generalized wavelets, mathematical morphology wavelet ,......
- 2023-01-17 00:10:04下载
- 积分：1
-
0_1背包问题使用一个给定n种去的动态规划解法…
0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
- 2023-04-12 03:25:02下载
- 积分：1
-
G.711G.72 3 compression source, and they hope to be helpful to everyone.
G.711G.72 3压缩源码，希望对大家有所帮助。-G.711G.72 3 compression source, and they hope to be helpful to everyone.
- 2022-03-23 05:37:41下载
- 积分：1
-
校际运动会管理系统
校际运动会管理系统-Schools Games Management System
- 2022-07-17 13:21:49下载
- 积分：1
-
哈弗曼编码算法的实现，用c++来实现算法
哈弗曼编码算法的实现，用c++来实现算法-huffman code
- 2022-08-07 07:16:52下载
- 积分：1
