C + + 二汽

k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k object as initial cluster centers and the remaining for the other object, then according to their cluster center with those of the similarity (distance) respectively assigned to them with the most similar (represented by cluster center) clustering obtained and then calculated for each new cluster center clustering (all objects in the cluster mean) repeated this process until the standard measure of function until the beginning of convergence.

对椭圆加密算法中的涉及的求模，求逆以及所有相关点集的计算，并对多倍点的计算做了计算

1. 实现原理： * 任何一个数都可以表示成指数形式，如下所示： * * N=nEe (0=

自动指纹识别系统设计-Automated Fingerprint Identification System Design

几何图形算法库，可以在delphi5上用-Geometry algorithms library, you can use on delphi5

指派问题的匈牙利解法，从文件中读入待指派的数据。-Assignment problem of the Hungarian method, read from a file to be assigned to data.

单纯型法-Simplex method

快速幂级2 跟前面的是一起的-rapid power level with the previous two are together

An edge guided image interpolation algorithm via directional filtering and data fusion

程序实现多项式相乘 或者说是褶积 因为两者是本质是相同的 程序里边的算法很巧妙 是从一个地球物理学家拿学来的-it is a good method to have convelution of two one_dimension array