-
Quick Mutli Search算法，对QuickSearch算法的改进，支持一次搜索多个子串、正/反向查找、不区分大小写查找...
Quick Mutli Search算法，对QuickSearch算法的改进，支持一次搜索多个子串、正/反向查找、不区分大小写查找-Quick Search algorithm, right QuickSearch algorithm, to support a number of search-string is/Reverse Search, Search is case insensitive
- 2022-06-16 10:27:20下载
- 积分：1
-
实现了图像的哈夫曼编码和解码，对图像编码的学习很有帮助...
实现了图像的哈夫曼编码和解码，对图像编码的学习很有帮助-Achieved image Huffman encoding and decoding of image coding learning helpful
- 2022-02-02 03:29:37下载
- 积分：1
-
zlib源码
zlib源码 -zlib source
- 2022-02-10 01:14:52下载
- 积分：1
-
insighttoolkit
InsightToolkit-1.4.0(有大量的优化算法程序)-InsightToolkit-1.4.0 (have a large number of optimization algorithms Procedure)
- 2023-08-26 22:45:07下载
- 积分：1
-
【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示...
【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示,最大长度可为255个重复字；(3) 重复字符。以上三部分合称为重复因子。可见要获得压缩效益，重复字符应在3个以上。2. 图像游程压缩的原理 对于二值图像，原始数据为零一矩阵，压缩时逐行处理该矩阵：(1) 连续n个1，表示为+n；(2) 连续n个0，表示为-n。-text and binary image-- an outbound trip. Yu Cheng text compression principle on repeated field using three symbols logo Act : (a) repeat prompt, such as @,#, etc.; (2) Run-length parameters, or the number of repeat, if using a byte, the largest the length of 255 to repeat the word; (3) repeat characters. More than three as part of a repeat factor. Visibility to gain compression efficiency, duplication of characters in three more. 2. Run-image compression for the principle of two binary images, a zero original data matrix, progressive compression deal with the matrix : (1) n a row, n; (2) consecutive n 0, expressed as-n.
- 2022-05-06 21:11:33下载
- 积分：1
-
UART驱动程序，是最底程的，在8位单凭机上已充分应用
UART驱动程序，是最底程的，在8位单凭机上已充分应用-UART driver, is the most at the end of the journey, eight alone in the plane has been fully applied
- 2023-02-08 17:05:04下载
- 积分：1
-
cab!
cab!
- 2022-07-03 10:22:43下载
- 积分：1
-
JAVA下的3Dmax的建立
JAVA下的3Dmax的建立-JAVA max under the Establishment
- 2023-06-08 20:35: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
-
VB network applications, such as : Chat system, browser procedures
VB网络应用,例如:聊天系统,浏览器程序-VB network applications, such as : Chat system, browser procedures
- 2023-01-18 10:50:04下载
- 积分：1
