-
- 2022-10-02 05:00:03下载
- 积分:1
-
这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在...
这是一个基于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.
- 2022-07-18 10:03:51下载
- 积分:1
-
Intelligent tracing off, obstacle avoidance, and time of tracing, as well as alo...
智能寻迹下车,避障,寻迹和时间,以及一路的路程显示,-Intelligent tracing off, obstacle avoidance, and time of tracing, as well as along the route show that
- 2022-06-16 15:09:11下载
- 积分:1
-
pvml源代码,提供下载,共同学习,共同进步
pvml源代码,提供下载,共同学习,共同进步-pvml source code, available for download, a common learning and common progress
- 2022-08-02 12:35:37下载
- 积分:1
-
判断外部程序启动没有
判断外部程序启动没有
判断外部程序启动没有
判断外部程序启动没有
-vb
- 2022-09-12 01:50:04下载
- 积分:1
-
DCT变换是图像图形处理中的很重要的一个压缩算法,此文件详尽的完成了DCT变换...
DCT变换是图像图形处理中的很重要的一个压缩算法,此文件详尽的完成了DCT变换-DCT transform is image and graphics processing is very important to a compression algorithm, this document contains details of the completion of the DCT transform
- 2022-05-31 23:24:52下载
- 积分:1
-
开发环境是CCS,在DM642平台上实现H.263编解码
开发环境是CCS,在DM642平台上实现H.263编解码-CCS is a development environment in DM642 platform to achieve H.263 codec
- 2022-02-02 20:26:10下载
- 积分:1
-
著名的压缩代码的最新版
著名的压缩代码的最新版-famous compression code to the latest version
- 2022-02-25 03:07:07下载
- 积分: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
-
Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the d...
Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the decoder take as input a file and write the output into another file.-Implementation for the Huffman Cod in Visual C++.
Both, the encoder and the decoder take as input a file and write the output into another file.
- 2022-01-24 16:56:24下载
- 积分:1