搜索资源列表
Boyer-Moore-Hospool
- 匹配算法，Boyer-Moore-Hospool匹配算法 这个算法在大文件中搜索小pattern有很高效率。 推荐用来代替strstr() 这个实现我没有测过，不过应该不会有大问题。 C++的代码，容易使用：） -matching algorithm, Boyer - Moore-Hospool matching algorithm The algorithm in document search small pattern has a high efficiency
比Boyer-Moore更快的字符串查找算法
- 比Boyer-Moore更快的字符串查找算法-than the Boyer - Moore string search for a faster algorithm
Boyer-Moore
- BM 算法是一个较优的模式匹配算法。一般，如果不考虑模式串的长度，一个具有时间复杂度O(n)的算法应该是最优的了，但是事实不是如此。BM算法可以实现更高效率的模式匹配。分析和实验说明，BM匹配算法对于那些字符集比较大，而模式串中出现的字符比较少的时候，工作效率最快。而且，考虑KMP匹配方式的优化，可以结合KMP匹配和BM匹配，进一步提高效率。
QSearchStr
- 一种改进的Boyer-Moore的字符串查找算法，并封装到类-an improved Boyer - Moore string search algorithms, and type of packaging
bmsearch_src.zip
- BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。,BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances
bmsearch
- 字符串搜索，采用boyer-moore算法最简单的描述实现，没有添加预处理和改进算法,若是英文搜索，区分大小写-String search, using boyer-moore algorithm described in the simplest implementation, did not add pre-processing and improve the algorithm, if the English search is case-sensitive
bm
- BM可以说是继KMP算法之后更加 优秀的字符串匹配算了，BM 是大师Boyer-Moore的算法杰作， 所以称BM算法， 相比KMP算法效率提高了不少， -BM can be said that after following the KMP algorithm for string matching better forget, BM is the master of the Boyer-Moore algorithm masterpiece, so that BM algorit
STRING
- 介紹了knuth-morris-pratt方法與化簡了的boyer-morre方法，這兩個方法在尋找字串中是否有一個特定的字串時有相當傑出的表現-Introduced knuth-morris-pratt methods and simplification of the boyer-morre method, the two methods in the search string if the string has a specific time to time the performanc
stringmatchin
- bore-moore模式匹配算法及一些改进算法-boyer-moore string matching algorithm and improving
Boyer-Moore
- Boyer-Moore.cpp BM算法的简单实现-Boyer-Moore.cpp BM algorithm
boyermoore
- 改进的boyer-moore算法，用于搜索二进制文件中的特征码。-Improved boyer-moore algorithm used to search a binary file signatures.
Pattern-matching
- 实现字符串的匹配，有常见的蛮力算法，kmp算法，Horspool算法,Boyer-Moore算法-String matching, common brute force algorithm, kmp algorithm, Horspool algorithm, the Boyer-Moore algorithm
boy
- boyer字串找尋 此為一種找尋字串的快速搜尋方法-the boyer string to find to find the string This is a fast search method
boyer_moore
- boyer moor算法应用程序代码时空权衡设计方法-the boyer moor algorithm application code space-time balancing design method
DecisionForest_v3.1
- [1] Quan Wang, Yan Ou, A. Agung Julius, Kim L. Boyer and Min Jun Kim, Tracking Tetrahymena Pyriformis Cells using Decision Trees , 2012 21st International Conference on Pattern Recognition (ICPR), Pages 1843-1847, 11-15 Nov. 2012. [2] Q
Fast_GVF_v1.0
- The C++/MEX implementation of Gradient Vector Flow (GVF) is much faster than the Matlab implementation. There is a demo.m file in this package, which shows how to run a simple demo. The package is used by: [1] Quan Wang, Kim L. Boyer, T
497690
- 字符串搜索,采用boyer-moore算法最简单的描述实现,没有添加预处理和改进算法,若是英文搜索,区分大小写()
based-robust-Xrimer
- 字符串搜索,采用boyer-moore算法最简单的描述实现,没有添加预处理和改进算法,若是英文搜索,区分大小写()
MLD&MLT&BLCalculations
- 用Argo的netCDF文件计算海洋混合层和障碍层深度并通过M_Map工具包画出全球海洋MLD和BL的分布图。 P.S.: 1.需先安装m_map的toolbox。2.混合层及障碍层的定义参考Clément de Boyer Montegut, et al. "Mixed layer depth over the global ocean: An examination of profile data and a profile‐based climatology." Jou