Location:
Search - BM算法
Search list
Description: bm算法的delphi实现-bm algorithm to achieve the delphi
Platform: |
Size: 24821 |
Author: 丘小恬 |
Hits:
Description: 单模式字符串匹配算法里面最经典的算法，KMP算法，KR算法 和BM算法
Platform: |
Size: 2820 |
Author: tjltail |
Hits:
Description: bm算法的delphi实现-bm algorithm to achieve the delphi
Platform: |
Size: 24576 |
Author: 丘小恬 |
Hits:
Description: 内有AES IDEA DES RSA BM算法。可以直接执行附有源代码。-within AES IDEA BM DES RSA algorithm. Can directly with the implementation of the source code.
Platform: |
Size: 1254400 |
Author: 张波 |
Hits:
Description: bm算法是串的一种匹配算法！本源代码介绍了bm算法的c实现。-bm algorithm is a string matching algorithm! Source code introduced bm Algorithm c achieve.
Platform: |
Size: 1024 |
Author: 文万志 |
Hits:
Description: 该BM算法用来求二元域上长度为１１的序列的线性综合解-the BM algorithm used for binary domain length of the sequence of 11 linear integrated solution
Platform: |
Size: 217088 |
Author: 傻傻 |
Hits:
Description: VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-VC++ programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. Here l is the linear complexity.
Platform: |
Size: 1911808 |
Author: 赖晖 |
Hits:
Description: AC-BM算法的实现的压缩包，很流行的字符串匹配算法，已经测试，-AC-BM algorithm for the realization of the compressed, the very popular string matching algorithm has been tested,
Platform: |
Size: 3072 |
Author: 李阳 |
Hits:
Description: 字符串匹配的BM算法,完全自己做出来的,
大家可以拿去参考,一切分享-BM string matching algorithm, completely on my own to do it, we can spend reference, all sharing
Platform: |
Size: 9216 |
Author: 小艾 |
Hits:
Description: BM 算法是一个较优的模式匹配算法。一般，如果不考虑模式串的长度，一个具有时间复杂度O(n)的算法应该是最优的了，但是事实不是如此。BM算法可以实现更高效率的模式匹配。分析和实验说明，BM匹配算法对于那些字符集比较大，而模式串中出现的字符比较少的时候，工作效率最快。而且，考虑KMP匹配方式的优化，可以结合KMP匹配和BM匹配，进一步提高效率。
-BM algorithm is a better pattern matching algorithm. General, if we do not consider the length of pattern, a time complexity O (n) algorithm should be optimal, but the fact is not the case. BM algorithm can realize more efficient pattern matching. Analysis and experiments, BM-matching algorithm for those relatively large character set, and the mode string of characters appearing in less time, the efficiency of the fastest. Moreover, consider the KMP matching optimization, you can match the combination of KMP and BM match, and further improve efficiency.
Platform: |
Size: 1024 |
Author: Louis |
Hits:
Description: java 实现的ＢＭ算法。
BM算法是一种字符串匹配算法。-java realize the BM algorithm. BM algorithm is a string matching algorithm.
Platform: |
Size: 8192 |
Author: 闫然 |
Hits:
Description: 一种比较理想，快速的字符串匹配算法-BM算法，匹配性能较优。-An ideal, fast string matching algorithm-BM algorithm, better matching performance.
Platform: |
Size: 2048 |
Author: malota |
Hits:
Description: 实现BM算法查找文本中字符串功能,给出匹配次数和所用时间。-BM algorithm to find the realization of the text string function, given the number and the matching time.
Platform: |
Size: 288768 |
Author: sifhay |
Hits:
Description: 字符串匹配BM算法算法源码
字符串匹配BM算法 源码 很好的 有新意-BM algorithm for string matching algorithm source BM string matching algorithms have a good new source
Platform: |
Size: 198656 |
Author: cuiyuzheng |
Hits:
Description: 经典的模式匹配算法，目前使用最广的单模匹配算法源代码BM算法-Classic pattern-matching algorithms, currently the most widely used single-mode-matching algorithm source code BM algorithm
Platform: |
Size: 169984 |
Author: asdf |
Hits:
Description: B-M 算法的matlab实现 密码学中又一重要的算法实现-BM algorithm matlab achieve another important cryptography algorithm implementation
Platform: |
Size: 1024 |
Author: xiaotiantian |
Hits:
Description: bm算法 c++代码实现 希望对你有用-bm algorithm c++ Implementation
Platform: |
Size: 1024 |
Author: hehua |
Hits:
Description: BM算法 一个小小的程序 仅供大家参考使用-BM algorithm is a small program you use and reference only
Platform: |
Size: 1608704 |
Author: imiffier |
Hits:
Description: 线性反馈移位寄存器序列求解极小多项式的BM算法(a method to find a minimum polinomial of a LFSR)
Platform: |
Size: 450560 |
Author: wxt201
|
Hits:
Description: 在计算机科学里，Boyer-Moore字符串搜索算法是一种非常高效的字符串搜索算法。它由Bob Boyer和J Strother Moore设计于1977年。此算法仅对搜索目标字符串（关键字）进行预处理，而非被搜索的字符串。虽然Boyer-Moore算法的执行时间同样线性依赖于被搜索字符串的大小，但是通常仅为其它算法的一小部分：它不需要对被搜索的字符串中的字符进行逐一比较，而会跳过其中某些部分。通常搜索关键字越长，算法速度越快。它的效率来自于这样的事实：对于每一次失败的匹配尝试，算法都能够使用这些信息来排除尽可能多的无法匹配的位置。(In computer science, Boyer-Moore string search algorithm is a very efficient string searching algorithm. It consists of Bob Boyer and J Strother Moore design in 1977. This algorithm only to search the target string (keywords) pretreatment, instead of a string to be searched. Although the execution time of Boyer-Moore algorithm also depends linearly on the size of the string being searched, but usually only a small part of other algorithms: it does not need to be searched in the character string for each comparison and will skip some. Usually the search key is longer, the faster algorithm. Its efficiency comes from the fact that the algorithm can use as much information as possible to exclude as many non matching positions as possible for each failed matching attempt.)
Platform: |
Size: 1024 |
Author: Never give up
|
Hits: