资源列表
k-mean
- cluster in data minig
Search
- 用C实现的查找算法函数，比较全面，拿来共享-Search algorithm implemented using C functions, relatively comprehensive, be used to share
Complex_computing
- 用C实现的复数运算的方法函数，上传来共享一下-Complex with the C implementation method of computing functions, upload to share what
Otsu
- This code binarize a grey image using OTSU Binarization
knn
- kNN算法c++实现及算法简介 附测试用例 附说明ppt-kNN algorithm and the algorithm c++ Implementation Note About attached test case attached ppt
librfa-0.0.tar
- 通用库，允许递归实时非确定性设置自动机施工时间的确定性-General purpose library that allows the construction of recursive deterministic automaton in real-time from non-deterministic settings
rmol-0.22.0.tar
- 该项目（RMOL）旨在通过收益管理舞台上的图书馆提供的算法和公布的一个参考实现方法，最关心，给予开发-That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods.
gsuffix-1.0.0.tar
- 该gsuffix库实现枚举的字符串搜索使用 serveral的算法。它采用了后缀树和后缀数组的数据结构，以及一些其他方法。-The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.
insulargenetica-win32-qt4.5-1.18beta
- 这是并行遗传算法的实现与“环”狭隘的拓扑结构。算法在进化提供了一个动态的遗传算子的选择。该库支持的26个遗传算子。这是跨平台的遗传算法用C+ +编写的。-This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library
5-1
- 分别用两个一维数组存放一个上三角矩阵和一个下三角矩阵，完成两矩阵的乘法并输出结果(使用特殊矩阵基本算法)-Were placed with two one-dimensional array of an upper triangular matrix and a lower triangular matrix, the completion of the two matrix multiplication and the output (using a special matrix of bas
1
- 写一个函数并调用，解决一个小球从h米高度自由落下,每次落下后反弹回原高度的 一半再落下,求它在第n次落地时共经过多少米-Write a function and call to solve a small ball from a height h meters in free fall, bounce back after each drop to half the original height and then fall, seeking its first n second floor w
1
- 写一个函数并调用，求数列2/1,3/2,5/3,8/5,13/8.21/13……求前n项之和。-Write a function and call, find the series 2/1, 3/2, 5/3, 8/5, 13/8.21/13 ... ... request before the n items combined.