rgb-cmyk

法是否是否是发生的方式放松放松佛挡杀佛是(放松放松的发生地发生地发)

老鼠走迷宮 迷宮圖油txt黨讀檔 使用DevC++撰寫的(Mouse Maze maze map oil txt file using the party' s reading of written DevC++)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

计算多项式的算法 数据结构计算多项式的加减发和乘法(data structure)

基于两步迭代收缩法和复数小波的压缩传感 图像重构 ( Based on two-step iterative shrinkage method and the complex wavelet compression sensor Image reconstruction )

基于stm32的jpeg图片压缩代码，并且通过串口输出(The stm32-based jpeg image compression code, and output through the serial port)

介紹在AWGN頻道上bit error rate的推導過程。附有詳盡的圖解與算示。(Describes the AWGN channel bit error rate of the derivation. Accompanied by detailed diagrams and calculation shown.)

WinEYS压缩源码例程，程序结合易语言扩展界面支持库，调用API函数实现压缩解压功能。(WinEYS source compression routines, programs combined with easy language support library expansion interface , call the API function to achieve compression and decompression functions.)

利用哈夫曼树对简单文件进行压缩和解压缩，对数据的压缩集成(Compression and Decompression of Simple Files Using Huffman Tree)

基于改进的不动点迭代算法的低秩Gram矩阵的恢复，里面包括一个24983*101的真实数据库。(Fixed point and bregman iterative methods for matrix rank )