haar-like人脸识别

计算圆周率可一到小数点后任意位,速度还不错-One can calculate pi to arbitrary places after the decimal point, speed is also good

资源描述#include #define maxsize 100 using namespace std; /*class base {     int length; };*/ class Seqlist                //实现顺序表类 {     private:         int size;        //当前元素个数         int length;            //当前表的总长度              public:         int *elem;            //动态存放数据         Seqlist();        //构造函数的声明         int listset();    //顺序表的创建    &nbs

RLS和遗传算法的PID在线整定，优化效果较好，在线整定控制PID参数

这个程序计算前n个素数。变量n由用户输入。

雅可比算法的算例程序，用简单明了的计算过程展示了雅可比算法的C设计过程。-Jacobi algorithm example program, with a simple and straightforward calculation shows C Jacobi algorithm design process.

该程序用来计算两台摄像机之间的基础矩阵，首先获取两台摄像机图像中的N组匹配点，采用8点法和ransac法，随机的选取8组匹配点对，计算基础矩阵，并且不断调整各个参数。最终结果与matlab的结果进行了比较，精度高。

设有n个人围做一圈，现从某个人开始报数，数到m的人出列，接着从出列的下一个人开始重新报数，数到m的人又出列，如此下去，直到所有人都出列为止。运用循环单链表解决约瑟夫环问题。- Is equipped with n personally to encircle makes, presently starts from some person to count off, leaves ranks the number to the m person, meets from the next person which leaves ranks is starting reto count off, leaves ranks the number to the m person, continue like this, all leaves ranks until all people. Using circulates Shan Lianbiao to solve the Joseph link problem.

1.二分查找 适用条件：查找序列已经有序 int binarysearch(int a[], int n, int x) {     int left, right, center;     left = 0;     right = n - 1;

实现md5算法。用c/c++实现的md5算法。想研究md5算法的可以下载。-Realize md5 algorithm. With c/c++ Realize the md5 algorithm. Md5 algorithm would like to study can be downloaded.

自己做的一个kmean聚类程序,里面有例子和聚类程序 -Their clustering kmean to do a procedure, there are examples and clustering procedures