-
使用事件和委托表演时钟
using event and delegate to perfoem clock
- 2023-08-07 00:30:03下载
- 积分：1
-
THE JPEG2000 STILLIMAGE CODING SYSTEM
THE JPEG2000 STILLIMAGE CODING SYSTEM
- 2022-01-26 05:43:29下载
- 积分：1
-
一个火焰程序，自动在屏幕上显示烟火
一个火焰程序，自动在屏幕上显示烟火-a flame procedures, automatically displayed on the screen pyrotechnics
- 2022-07-01 21:16:11下载
- 积分：1
-
高的实现
本程序实现了高速的bmp图片到jpg图片的压缩，其中使用了动态连接库，使得压缩速度有了很大提高，而且使用非常简单。-the realization of high-speed bmp jpg photo to photo compression, the use of the dynamic link library, makes compression speed has been greatly improved, but it is very simple.
- 2023-07-16 23:10:03下载
- 积分：1
-
小游戏，一款可以自行使用的象棋游戏，你可以轻松的上交作为作业。...
小游戏，一款可以自行使用的象棋游戏，你可以轻松的上交作为作业。-small game, one is free to use the chess game, you can easily surrendered as operations.
- 2022-02-28 09:56:19下载
- 积分：1
-
this code tree with Hoffman as the compression and decompression of the storage...
此代码用霍夫曼树作为压缩和解压缩的存储结构，实现了字典压缩算法，用C便已成功。-this code tree with Hoffman as the compression and decompression of the storage structure and achieve a dictionary compression algorithm has been successfully used C.
- 2022-04-23 00:32:34下载
- 积分：1
-
Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the d...
Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the decoder take as input a file and write the output into another file.-Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the decoder take as input a file and write the output into another file.
- 2022-01-24 16:56:24下载
- 积分：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
-
The development of both the wavelet transform function of image wavelet transfor...
开发的两个小波变换函数对图像进行小波变换-The development of both the wavelet transform function of image wavelet transform
- 2022-02-04 20:30:53下载
- 积分：1
-
That is, can understand the principle of Huffman coding, you can understand the...
That is, can understand the principle of Huffman coding, you can understand the image compression technology
- 2022-11-19 00:45:04下载
- 积分：1
