-
SPIHT
实现SPIHT算法!!!!使用MATLAB 实现程序(SPIHT algorithm realize!!!! Realize the use of MATLAB procedures)
- 2021-04-26 15:18:45下载
- 积分：1
-
Genertate-LG-Beam
压缩包中包含有拉盖尔函数、缔合拉盖尔函数以及产生拉盖尔高斯光束的文件。光束的两个量子数可以任意修改(Compressed packet contains Laguerre functions, Laguerre functions and association Laguerre Gaussian beam generated files. Beam two quantum numbers can be modified)
- 2013-05-28 20:40:43下载
- 积分：1
-
lzari压缩算法
这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)
- 2005-03-06 13:01:17下载
- 积分：1
-
unzip540
完整的解压zip文件的源码。包含密码功能(The source of uncompress zip file, contains password)
- 2020-06-26 13:00:01下载
- 积分：1
-
纸飞机4.0
ssr科学上网工具，该压缩文件已经配置好了，直接解压就可以使用了。(SSR scientific Internet access tool, the compressed file has been configured, the direct decompression can be used.)
- 2020-06-29 08:40:01下载
- 积分：1
-
LZ77
这是LZ77压缩算法的源码，内含使用DEMO(LZ77 compression algorithm This is the source, including the use of DEMO)
- 2009-03-10 17:29:50下载
- 积分：1
-
Wavelet_OMP
说明： 运用压缩感知的原理对图片进行处理 并通过正交匹配追踪法进行图像的重构(compressed sensing for colour image and the reconstruction by OMP)
- 2010-04-01 16:50:41下载
- 积分：1
-
3542600_d04376dd2aa0bb13cfe65f01dc4a5e48
说明： fxstabilizer-ea-fx84netFXS.dll, 3485696 , 2015-09-17
fxstabilizer-ea-fx84netstabilizator.ex4, 72650 , 2015-09-17
- 2019-05-01 18:22:06下载
- 积分：1
-
C语言 文件的解压缩
文件的解压缩。添加文件unzip.h、unzip.cpp、zip.h、zip.cpp，调用对应函数进行压缩和解压。压缩格式为zip；压缩之后的文件可以用winrar等程序打开。(File decompression. Add file unzip.h, unzip.cpp, zip.h, zip.cpp, call the corresponding function for compression and decompression. Compression format is zip the file after compression can be opened by winrar.)
- 2020-07-14 09:58:51下载
- 积分：1
-
Traversalalgo
Codes".
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.
- 2009-12-01 04:47:10下载
- 积分：1
