asp 源代码及教程下载站 包个人开发的一组商业网站源代码

对英文字母的哈夫曼编码-right alphabetic Huffman coding

Thesis from the Charles University (Prague) about Kononen s Self-organizing maps. In English.

用于压缩文件与文件的解压用于压缩文件与文件的解压-Used to extract the compressed files and documents used to extract the compressed files and documents

这个是我前一段时间在国外网站上找到的16-bit的霍夫曼编解码器。我们常用的都是8-bit的，希望这个对大家有用。尤其是对医学图像，因为其有8位，12位，16位等。-i got this 16-bit huffman codec from abroad website. we usually use 8-bit huffman codec. this source code is especially useful for medical image process.

JPEG解压源码-JPEG decompression source code

RAR源码相关，用于编写压缩算法-RAR-related source for the preparation of compression algorithm

很麻烦的源码上传，郁闷，什么时候能改变一下，为什么要20个字啊-From a source very troublesome, depressing, when you change, why should the 20 words ah

TML的参考源代码-TML reference source code

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.

块Berne Lang Begin Tone char*DestFile小片Lang Lang Begin Tone（注意皮带引毛）*//*int SlidingWinSize tiny Philippine fence或疏忽音调*//*int PreviewInsize tiny Colon Hai Yao Postscript音调