RC500 DEMO upper plate collection of various data compression package.

Chip type : ATmega8 Program type : Application Clock frequency : 8.000000 MHz Memory model : Small External SRAM size : 0 Data Stack size : 256 *****************************************************/ #include #include #include #include #include #include #define TG PORTB.1 #define RF_Rx PIND.2 #defi-Chip type : ATmega8 Program type : Application Clock frequency : 8.000000 MHz Memory model : Small External SRAM size : 0 Data Stack size : 256 *****************************************************/ #include #include #include #include #include #include #define TG PORTB.1 #define RF_Rx PIND.2 #defi

方便处理JPEG格式图片的基于VC的源代码-facilitate the processing of JPEG images based on the source code VC

基于Huffman变换的图像压缩算法，c++语言开发的。-image Compression algorithm based on Huffman

self contained Huffman encoder and decoder with CLI. Simple program written in C. The program encode text entered to a file. The file is used by the decoder to recover text.

连续色调图像无损（近无损）压缩标准Jpeg_Ls源代码-continuous tone image lossless (Near-lossless) compression standard source code Jpeg_Ls

查看网络的好工具，可以查看POST数据，参数，Cookies等-See a good tool for the network, you can view the POST data, parameters, Cookies, etc.

上载多少才可以下一个啊>-available only following a number ah

good code for image processing people and students

一个不错的电子相册建立程序工具，很好用的，希望大家喜欢！-A good electronic album to establish procedures for tools, well used, I hope everyone likes!

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.