Online Chat

PHP空间上传打包下载工具.如果你的FTP服务器不是很好的话`你会用的着的`上传很快的-PHP Upload packing space to download tools. If your FTP server is not very good words you would use to upload the soon

Adaptive Difference PCM code in matlab

最短路径算法C C++ 邻接矩阵实现 哈夫曼算法和哈夫曼树 RSA算法的C++实现 lzw压缩算法的c语言实现 计算日期程序（C语言） -Shortest path algorithm C C++ Adjacency matrix realize Huffman Huffman tree algorithm and RSA algorithm C++ Realize LZW compression algorithm c language procedures realize the calculation date (C language)

获取文件的源代码！通过，一系列的调用，实现同系统的资源同步，实现！-Access to source code files! Adopted a series of calls to achieve synchronization with the system resources, realize!

在flex中调用图像处理,不错的，可是试用一下-compress decompress

游程编码的主要部分，对简单的变化缓慢，重复出现的数据有很好的压缩效果-Run-length coding of the main part of a simple change in the slow, repeated data compression has a very good effect

encoder 视频会议 视频编码算法 源程序 -video conferencing encoder video source coding algorithm

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.

ACMS压缩算法-acms encode algorithm

infozip2.2源码-The source of infozip2.2