加权的 KNN

两个聚类中心之间的最小距离，如小于此数，两个聚类进行-two cluster centers between the minimum distance, as tens of thousands of small, two Clustering

矩阵直接三角分解法的c++语言实现 -direct triangular matrix decomposition of the C Language

最优化算法，包括各种线性优化和非线性优化问题-Optimization algorithms, including linear optimization and nonlinear optimization problems

图像对数极坐标转换(从平面坐标到极坐标的变换,关键在于坐标变换公式)，能够计算旋转及尺度变换

资源描述1000个C语言算法设计源码包含大量经典算法设计，简明易懂，对初学者很有帮助，文件很好的进行了分类

这是一个DDS程序,用VHDL编写,实现的是一个频率可调的方波-This is a DDS procedures, using VHDL prepared achieve is a frequency adjustable square

selection排序法-Selection sorting method

用单纯性法求解线性规划问题，并通过控制台输入系数矩阵。-Using simple method for solving linear programming problems, and through the console input coefficient matrix.

自动俄罗斯方块，能够自己消行，消行达到15000左右，但有些还待改进-Auto Tetris, to make their own consumer line, elimination of about 15,000 lines, but there are still room for improvement

The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in the range of two supplied numbers a and b (5