sift算法源代码

对数回归方程 LogarithmRegress.cs 方程模型为 Y=a*LnX+b public override double[] buildFormula() 得到系数数组，存放顺序与模型系数相反，即该数组中系数的值依次是b,a。 public override double forecast(double x) 预测函数，根据模型得到预测结果。 public override double computeR2() 计算相关系数（决定系数），系数越接近1，数据越满足该模型。 -Logarithmic regression equation LogarithmRegress.cs equation model for Y = a* LnX+ Bpublic override double [] buildFormula () get coefficient array, the storage order and model coefficients contrary, that is, the array is followed by the value of coefficient b, a. public override double forecast (double x) prediction function, according to the results of model prediction. public override double computeR2 () calculated the correlation coefficient (determination coefficient), coefficient of the closer one, the data satisfy the model more.

邮件过滤器项目是在java平台上开发的。本计画的主要目标是发展一个高效的邮件系统，为使用者资料提供高安全性。&在目前的情况下，邮件安全非常重要，因为许多重要信息都是通过邮件分割的。垃圾邮件和仿冒邮件正在邮件中造成严重问题。为了解决这个问题，我们正在实现一个java邮件过滤器应用程序，通过它可以限制不需要的和不安全的邮件。

牛顿差商法求数值拟合。包文件中包含一个例子结果文件，包括输入和输出的结果。-poor numerical fitting. Packet document contains an example of the outcome document, including input and output results.

qr方法求赫申伯格矩阵的全部特征值-qr Hoeschen way for the full Burg matrix eigenvalue

递推关系的建立及在信息学竞赛中的应用 欢迎下载ginger547的算法资料-recurrence relations and the establishment of the Information Science Contest welcome to download the application of the algorithm information ginger547

acm模式“中心”算法-acm model "center" algorithm

n个石头(每相邻两个的距离是1米,最边上石头和岸的距离也是1米),礼物放在第m个石头上,青蛙第i次跳2*i-1米.问能否得到礼物.(n>=49肯定能得到礼物,n

program compare files in 2 directories. argv[1/2] - folder_1/2, argv[3] - file with result

一个高效的自回避行走路径枚举程序。运用了多线程分配分支任务，可以port到多核cpu上加速运算。-An efficient path of self-avoiding walk enumeration procedures. Use of multi-threaded allocation branch mission, you can port to multi-core cpu on accelerated computing.

bfgs算法求全域最小数值点，c++源程序,文件读入套用方便-bfgs domain algorithm ambitious minimum values, c source, the document read into the convenient use