资源列表
Huffmancoding
- 哈夫曼在上世纪五十年代初就提出这种编码时，根据字符出现的概率来构造平均长度最短的编码。它是一种变长的编码。在编码中，若各码字长度严格按照码字所对应符号出现概率的大小的逆序排列，则编码的平均长度是最小的。（注：码字即为符号经哈夫曼编码后得到的编码，其长度是因符号出现的概率而不同，所以说哈夫曼编码是变长的编码。）-Huffman in the early fifties of last century to make such a code, depending on the probability
shannon-fano
- Shanon fano code for calculating entropy,efficiency
1Dcsamtforw
- 可控源音频大地电磁法 一维正演 最小二乘法-CSAMT One-dimensional forward modeling least square method
Sobel
- calcule the sobel of image-calcule the sobel of image
huffman-5.23
- 这是一款简单的哈弗曼压缩器，用于进行简单的文件压缩。-Huffman compression, and for performing a simple file compression.
sharbati.m.tar
- 1D Compressor Design
vb
- 控制其他程序成为自己的子窗体 控制其他程序成为自己的子窗体-Control of other programs to become its own form a subset of other procedures to control their own sub-form
cv6
- Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
hook
- 剩余SetWindowsHookExA与CallNextHookEx拦截键盘输入。-Keyboard hook
hafuman
- hafuman压缩算法，完整地实现了hafuman压缩-hafuman compression algorithm, the full realization of the hafuman compression
Intensite
- calculate intensité of image
smallGame
- 这是一个小游戏的程序代码.供初学c或c++的朋友参考-This is a small game program code. For beginner c or c++ friend of reference