-
LZSS78.C
LZSS78.C -- A Data Compression Program Haruhiko Okumura 4/6/1989 -LZSS78.C-- A Data Compression Program Haruhiko Okumura 4/6/1989
- 2022-10-13 18:55:03下载
- 积分：1
-
achieve dancing robot
跳舞机器人的实现-achieve dancing robot
- 2023-06-14 17:00:02下载
- 积分：1
-
压缩、解压缩（压缩率高，费时较长）
压缩、解压缩（压缩率高，费时较长）-compression, decompression (high compression rate, longer time-consuming)
- 2022-12-15 06:40:03下载
- 积分：1
-
h.264算法的源代码，具体适用于哪个个平台目前还不是很清楚
h.264算法的源代码，具体适用于哪个个平台目前还不是很清楚-h.264 algorithm source code, which applies specifically to the platform is not yet clear
- 2022-03-17 14:37:25下载
- 积分：1
-
关于一些算法的例子，我看着还不错，有不足的地方希望大家指导...
关于一些算法的例子，我看着还不错，有不足的地方希望大家指导-Algorithm on some examples, I looked pretty good, has the shortage of places I hope to guide U.S.
- 2022-11-02 15:55:03下载
- 积分：1
-
类似24点的任意数计算，
类似24点的任意数计算，-EEEE
- 2023-05-05 05:50:03下载
- 积分：1
-
Survey data compression technology (PPT)
数据压缩技术概论(PPT)-Survey data compression technology (PPT)
- 2022-07-10 21:08:32下载
- 积分：1
-
内存池技术的一个展示
内存池技术的一个展示-memory of a pool display
- 2023-03-16 20:35:04下载
- 积分：1
-
H264_Player(非源码)
H264_Player(非源码)-H264_Player
- 2023-01-14 22:00: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
