在八个城市之间建造电视微波中继站，如图是可行线路，弧旁数字为费用。试建在哪个城市可实现连通每个城市且费用为最低。...

lzma 压缩 4.06version-LZMA compression 4.06version

做成界面的基于小波的spiht算法压缩解压缩编码-Make the interface of the SPIHT algorithm based on wavelet compression decompression coding

zlib源码 -zlib source

This an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

超强的压缩软件。其压缩比例远强于WinRAR 和WinZip-super compression software. Its compression ratio is far stronger than WinRAR and WinZip

开发的两个小波变换函数对图像进行小波变换-The development of both the wavelet transform function of image wavelet transform

该程序实现了VB调用Jpg和Bmp格式相互转换API函数的示例，使用非常方便-the VB program called the Broadband and Bmp format conversion API examples, very convenient to use

有关如何绑定文件的一个例程-on how to bind a document routines

compressive sensing 新版本MMA14- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity" and the Re-weighted algorithm of Rick Chartrand and Wotao Yin "Iteratively Reweighted Algorithms for Compressive Sensing" In order to run this example you need to install all these m.files in the same directory and type trialSP2 at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap