搜索资源列表
likestring
- 寻找字符相似度的改进算法，来自微软公司的编程之美-Improved algorithm to find the character similarity, from the beauty of Microsoft' s programming
HuffmanCode
- 现在有篇文章，请用二进制前缀编码对文章中出现所有字符进行其编码，使编码后的文章总长最短。 多组输入，第一个正整数T表示组数。 每组第一行有一个正整数n，1≤n≤100000表示所用的字符种数。 接下来一行为n个正整数，表示每个字符在文章中出现的次数。 输出编码的最小长度-There are articles, please use the binary prefix code for the article appeared in the encoding of
321589
- 问题描述：根据给定字符的使用频率，为其设计哈夫曼编码。 设计要求： 1．功能：求出n个字符的哈夫曼编码。 2．输入：输入n个字符和字符在电文中的使用频率。 3．输出：n个字符的哈夫曼编码。 -Problem Descr iption: According to the frequency of use given character, to design Huffman coding. Design requirements: 1. Function: Find the n
Huffman
- 请根据已知内容设计其中出现的字符的赫夫曼编码。 用设计出的赫夫曼编码对上面这段英文内容进行编码和译码 -Designed according to the contents of which are known to occur in the character of the Huffman encoding. Huffman coding with the design of this English content on the above encoding and decoding
shamir
- This program makes some operations on the polynomials, such as addition, multiplication and calculating Lagrange polynomials. It also finds a key for encryption of a text and then does encryption process by using xor (exclusive-OR) of each character
CR1
- character recognition neural network
delete_space_for_string
- 对c++中的string类型的数据，总结了不同的删除其中空格字符的小算法。-On c++ string type in the data, summarizes the different space character of the small delete algorithm.
hw5
- 使用Matlab去LOCATE语音信号，尤其是UNVOICED的语音信号-how to locate the beginning and end of the speech, especially when the signal start from the unvoiced character
统计一串字符的个数
- 定义一个类，分别统计一串字符的大写字母、小写字母、空格、数字和其他字符的个数。-Defines one class, counts a string character separately the capital letter, the lowercase letter, the blank space, digital and other character integer.
Classic_structures
- VC++数据结构经典算法源码包,包括底层编程、校验算法、问题算法、文件算法、大小写转换、进制转换、字符转换、数组、单链表、二分查找等！ -VC++ source package classical algorithm data structures, including low-level programming, calibration algorithm, the problem algorithms, file algorithms, case conversion, base con
xbj
- 归一化小波矩，非常简单易懂，程序完美，找的非常辛苦，人品担保，绝对可用-Normalized wavelet moment, very easy to understand, the program perfectly, looking very hard, character guarantees, absolutely free! ! !
liaotianfenci
- 一种基于国标2312（GB2312）汉字编码标准的分词算法，实现的分词效果是分成单个的汉字，可以识别英文、空格、中英文符号和数字等。也称原子分词算法。-Based on GB 2312 (GB2312) Chinese character coding standard segmentation algorithm to achieve the segmentation effect is divided into individual characters, can be identified
Immunity-clone-algorithm-with-mutation-coevolution
- 利用免疫系统的克隆选择机制,提出一种用于函数优化的算法. 算法的主要特点是:在迭代过程中,不仅抗体得到进化,同时建立变异向量集,令变异向量同步进化,协同工作,达到优化的目的. 仿真实验表明,所提出的算法能以较快的速度完成给定范围的搜索和全局优化任务-By using the clonal selection echanism of the immune system , a method for function optimizing is proposed. The character of
palindrome
- 分解解析文章的程序。可以将各个字符出现的频率排序。-Decomposition process analytical articles. You can sort the frequency of each character.
huffman
- 哈夫曼树，即最优树，是带权路径长度最短的树。输入字符和权值输出哈弗曼编码-Enter the character codes and weights of the output Hafu Man
xihua
- matlab,图像细化函数，适合字符图像细化-matlab, image thinning function for the character image thinning
Huffmancoding
- 哈夫曼在上世纪五十年代初就提出这种编码时，根据字符出现的概率来构造平均长度最短的编码。它是一种变长的编码。在编码中，若各码字长度严格按照码字所对应符号出现概率的大小的逆序排列，则编码的平均长度是最小的。（注：码字即为符号经哈夫曼编码后得到的编码，其长度是因符号出现的概率而不同，所以说哈夫曼编码是变长的编码。）-Huffman in the early fifties of last century to make such a code, depending on the probability
hafumanTree
- 数据结构课程设计，在VC环境下完成，利用哈夫曼树原理，主要功能是实现字符的压缩和解压缩，设计脉络清晰，易懂-Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear struc
shibie
- 基于matlab实现的 文字识别设计(2) 附带图片-Matlab implementation of character recognition based on design (2) Poster
lzw
- LZW码能有效利用字符出现频率冗余度进行压缩，且字典是自适应生成的，但通常不能有效地利用位置冗余度。-Effective use of LZW code redundancy character frequency compression, and adaptive dictionary is generated, but usually can not effectively use the position redundant.