-
Wireless-CS
简单的压缩感知用于无线传感器的例子，还有贝叶斯压缩感知(Simple compress perception used for wireless sensor examples, and the bayesian compression perception
)
- 2020-10-15 10:47:29下载
- 积分：1
-
cccc
输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)
- 2010-05-11 21:19:20下载
- 积分：1
-
RecordManagementSystem-devoleped-by-VC
说明： 压缩包包括完整的实例代码，可供大家研究和学习，内附说明！(Archive includes a complete example code, for all research and study, included instructions!)
- 2010-04-21 15:07:24下载
- 积分：1
-
游程编码
文件中有两个编码程序，一个是简单的游程编码仿真实现，另一个是图像的游程压缩编码实现(There are two coding programs in the file. One is a simple run-length coding simulation implementation, the other is the image run-length compression coding implementation.)
- 2020-06-25 13:00:02下载
- 积分：1
-
hmm
连续隐马尔可夫模型hmm的matlab程序(Continuous Hidden Markov Model of matlab procedures hmm)
- 2020-06-29 19:00:02下载
- 积分：1
-
CS的一些重构算法
压缩感知的所有重构算法，包括OMP,ROMP,SAMP,StoMP等等算法。(All reconstruction algorithms of compressed sensing include OMP, ROMP, SAMP, StoMP and so on.)
- 2021-03-26 22:19:13下载
- 积分：1
-
Cross-Entropy
交叉熵实现多元高斯混合模型优化的源代码，供大家学习使用(Realize cross-entropy optimization of multi-Gaussian mixture model of the source code for the U.S. study the use of)
- 2009-02-11 16:55:44下载
- 积分：1
-
ken
老鼠走迷宮 迷宮圖油txt黨讀檔 使用DevC++撰寫的(Mouse Maze maze map oil txt file using the party' s reading of written DevC++)
- 2009-11-30 00:40:07下载
- 积分：1
-
MyBitMapCompress
说明： 一个简单的32位位图压缩算法，基本思想是，扫描像素点，后面有雷同的就记下重复次数。(A simple 32-bit bitmap compression algorithm, the basic idea is to scan pixel, behind identical repetitions on the record.)
- 2010-04-13 22:43:43下载
- 积分：1
-
HuffMan
哈夫曼编码译码系统，设置发送者和接受者两个功能，
发送者的功能包括：
①输入待传送的字符信息；
②统计字符信息中出现的字符种类数和各字符出现的次数（频率）；
②根据字符的种类数和各自出现的次数建立哈夫曼树；
③利用以上哈夫曼树求出各字符的哈夫曼编码；
④将字符信息转换成对应的编码信息进行传送。
接受者的功能包括：
①接收发送者传送来的编码信息；
②利用上述哈夫曼树对编码信息进行翻译，即将编码信息还原成发送前的字符信息。
(Huffman decoding system, set the sender and the recipient of two functions, the sender' s features include: (1) input to be transmitted character information ② statistical character information, the number of types of characters and characters the number of occurrences (frequency create a Huffman tree) ② According to the number of types of characters and their respective number of occurrences ③ use the Huffman tree to find the characters Huffman coding ④ character information into the corresponding coding information for delivery. The recipient of the features include: (1) to receive the coded information to the sender transmission ② above Huffman tree coded information to be translated, is about to coded information to restore the character information before sending.)
- 2012-06-21 21:01:17下载
- 积分：1
