-
一个文件压缩打包库的源代码
一个文件压缩打包库的源代码-a compression packing for the source code
- 2022-02-21 20:49:31下载
- 积分：1
-
Control of the map to add the ODBC, ADO and other database data access features...
在地图控制中添加了ODBC、ADO等方式获取数据库数据等功能-Control of the map to add the ODBC, ADO and other database data access features such as
- 2022-07-22 04:48:51下载
- 积分：1
-
vb编的VB 的扑克牌游戏
vb编的VB 的扑克牌游戏-vb series of the VB poker game
- 2022-04-15 17:36:29下载
- 积分：1
-
树与二叉树转换，用的是c++
实现任意形状的树（使用广义表的方式从键盘输入）与二叉树的相互转换的实现...
树与二叉树转换，用的是c++
实现任意形状的树（使用广义表的方式从键盘输入）与二叉树的相互转换的实现-iohdiuosopidiosjdksddd
- 2023-08-25 16:15:04下载
- 积分：1
-
Data compression algorithm LZMA, contains c c++ Java and other languages. Realiz...
数据压缩算法LZMA,包含c c++ java等各种语言.主要实现的环境是vc++6.0.-Data compression algorithm LZMA, contains c c++ Java and other languages. Realize the environment is a major vc++ 6.0.
- 2022-01-24 10:04:32下载
- 积分：1
-
纯粹用vb实现的压缩算法，由高手完成，使用简单方便
纯粹用vb实现的压缩算法，由高手完成，使用简单方便-The compress arithmetic realised absolutly on VB platform.The programme which can be conveniently used is completed by a superior.
- 2022-03-07 20:23:21下载
- 积分：1
-
based on the SDK image acquisition procedures
基于SDK的图像采集程序-based on the SDK image acquisition procedures
- 2022-01-26 05:04:55下载
- 积分：1
-
ZPAV（H265）PC（x86）演示
ZPAV (H265) PC(X86) demo
ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4,
ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ......
ZPAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，
ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，......
-ZPAV (H265) PC (X86) demo ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV ( H265) is the audio and video compression decompression agreements, very different from the H264/MPEG4, ZPAV (H265) the basic algorithm is a wavelet, multi-level tree collection groups, generalized wavelets, mathematical morphology wavelet ,......
- 2022-01-26 03:21:30下载
- 积分：1
-
每一步的LZSS算法发送一个字符或<；位置，冷…
In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap
- 2022-07-08 14:12:34下载
- 积分：1
-
student managment system
学生管理系统
- 2022-02-28 12:44:44下载
- 积分：1
