-
一个简单的压缩算法源程序,希望能给大家带来帮助
一个简单的压缩算法源程序,希望能给大家带来帮助-A simple compression algorithm source code, I hope everyone can help
- 2022-03-26 03:40:56下载
- 积分:1
-
Huffman coding based on the compression and decompression procedures, huffman co...
基于huffman编码的压缩与解压程序,huffman编码是信元编码的一种,用于无损压缩,这里给出一个压缩与解压程序-Huffman coding based on the compression and decompression procedures, huffman coding is a cell encoding for lossless compression, which gives a compression and decompression procedures
- 2022-09-21 04:55:03下载
- 积分:1
-
详细见内部说明,只要把所有的.java放内开发环境中就运行带有MAIN的主程序就行!...
详细见内部说明,只要把所有的.java放内开发环境中就运行带有MAIN的主程序就行!-detailed see internal notes, As long as all. java up within the development environment on the operation with the main program on MAIN OK!
- 2022-01-26 18:48:48下载
- 积分:1
-
高效率的一种通用压缩/解压程序
高效率的一种通用压缩/解压程序 - High efficiency one kind of general compression/decompression
procedure
- 2022-11-25 14:00:02下载
- 积分:1
-
解决约瑟夫环问题的一个程序
解决约瑟夫环问题的一个程序-solve a problem of procedure
- 2022-03-20 03:20:16下载
- 积分:1
-
Matlab classic model program plan (the latest recommended) modeling _ 93 footbal...
matlab经典模型程序图(最新推荐)
93年建模_足球排名、DNA排序、matlab实验报告、采矿、层次分析法、电梯概率模型、工序安排、数学实验课练习、席位分配、行星问题、学习练习文件、智力游戏_十全十美_解法、钻井问题等!! -Matlab classic model program plan (the latest recommended) modeling _ 93 football rankings DNA sequencing, Matlab experimental report, mining, AHP, Elevator probability model, processes, Mathematical experiment practice, the distribution of seats, planets, learning exercises, intellectual games _ _ perfect solution. Drilling problems! !
- 2022-03-09 13:01:11下载
- 积分:1
-
C代码完成jpeg编码和解码,包括dct,量化,zigzag以及霍夫曼编码、解码...
C代码完成jpeg编码和解码,包括dct,量化,zigzag以及霍夫曼编码、解码-C code to complete jpeg encoding and decoding, including dct, quantization, zigzag and the Huffman code, decoding
- 2022-03-02 17:24:15下载
- 积分:1
-
真人发声,语音报时!(含软件),编程使用 AHM、LMD控件
真人发声,语音报时!(含软件),编程使用 AHM、LMD控件-Live voice, voice time! (Including software), programming the use of AHM, LMD controls
- 2022-12-19 02:20:03下载
- 积分:1
-
Map coloring to each city on the map as a point of abstraction, and to every cit...
地图着色把地图上的每个城市抽象为一个点,并给每个城市编号,,相邻的城市之间用直线连接。据此做出邻接矩阵,若第i个城市与第j个城市相邻,则metro[i][j]=1,否则metro[i][j]=0。
算法:按照编号从小到大的顺序检查每个城市,对每个城市从1到4使用4种颜色着色,若当前颜色可用(即不与相邻城市颜色相同),则着色;否则测试下一种颜色。
-Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.
- 2022-02-12 12:09:41下载
- 积分:1
-
Listless SPIHT, JPEG2000 faster than the speed, compression ratio almost
无链表SPIHT算法,速度比JPEG2000快,压缩比差不多-Listless SPIHT, JPEG2000 faster than the speed, compression ratio almost
- 2022-12-07 05:10:03下载
- 积分:1