搜索资源列表
-
0下载：
扩展欧几里德定理和中国剩余定理，ACM算法课件，比较简洁-Extended Euclidean theorems and Chinese Remainder Theorem, ACM algorithm courseware, simple comparison
-
-
0下载：
( Rightmost Digit )代码：数论模幂算法（从左向右）0ms
最小公倍数-辗转相除法
Prim最小生成树-Rightmost Digit, modular exponentiation algorithm (from left to right) 0ms
Least common multiple- Euclidean algorithm
Prim minimum spanning tree
-
-
0下载：
运用欧几里得算法求解最大公约数，并对算法的时间性能进行分析
-Greatest common divisor using the Euclidean algorithm, and analyze the performance of the algorithm time
-
-
0下载：
java实现多项式加法，乘法，除法，利用辗转相除法求两个多项式的最大公因子-java achieve polynomial addition, multiplication, division, using Euclidean algorithm for greatest common divisor of two polynomials
-
-
0下载：
此源程序为层次聚类中AGNES聚类法算法部分，测试数据须自己输入，测试前最好先看下源码
测试数据只有2个属性，可根据自己需求修改数据结构体属性个数，与对象间欧式距离计算函数
本源码若算法复杂度有可改进的地方或有BUG请高手指出，计算500条以上的数据时须耐心等待结果
-The source code for the hierarchical clustering algorithm in part AGNES clustering method, the test data requ
-
-
0下载：
欧几里得算法
Euclidean algorithm
希望帮到大家-Euclidean algorithm
-
-
0下载：
欧几里得算法,用来计算两个数的最大公约数。此算法，基于数论的偶记离得算法-Euclidean algorithm, used to calculate the greatest common divisor of two numbers. This algorithm, based on number theory even remember from the algorithm
-
-
1下载：
改进欧氏距离测度算法，可以比较特征向量的距离相似度-Improved algorithm Euclidean distance measure, you can compare the similarity distance of feature vectors
-
-
0下载：
欧几里得算法 非常给力 值得参考 招来不易啊-Euclid' s algorithm is very difficult to force ah worth considering provoke
-
-
0下载：
实验项目- 计算最大公因子
用辗转相除法求210与715的最大公因数。-Experimental project- calculate the greatest common factor with the Euclidean algorithm 210 and 715 of the greatest common divisor.
-
-
0下载：
辗转相除法 模重复平方；模P平方根；三个算法的C++实现-Euclidean algorithm mold repeat square mold P Square Root
-
-
0下载：
该VC程序中，包含了求最大公约数的三种方法：1、欧几里得算法；2、求全部质因数方法；3、连续整数检测方法-The VC program, including the common denominator of the three methods: 1, Euclidean algorithm 2, find all the prime factor method 3 consecutive integers detection method
-
-
0下载：
<1> 用辗转相除法求最大公约数
算法描述:
m对n求余为a, 若a不等于0
则 m <- n, n <- a, 继续求余
否则 n 为最大公约数
<2> 最小公倍数 = 两个数的积 / 最大公约数*/-< 1> with the common denominator Euclidean algorithm descr iption: m for n remainder of a, if a is not equal
-
-
0下载：
实现了KNN文本的分类，KNN最近邻基于欧几里德距离的JAVA算法实现适用于初级学习KNN的初学者。-Realization of KNN text classification, KNN nearest neighbor JAVA algorithm for Euclidean distance implementation is applied to the primary learning KNN beginners based on.
-
-
0下载：
自己编写的最近邻KNN算法，采用的距离是欧氏距离，附加了详细的中文注释，还有一个测试集和一个训练集-
I have written KNN nearest neighbor algorithm, the distance is the Euclidean distance, additional detailed notes in Chinese, as well as a test set and a training set
-
-
0下载：
sar图像去噪的几种新的方法，基于欧几里得距离的聚类分析，cordic算法的matlab仿真。- Several new methods sar image denoising, Clustering analysis based on Euclidean distance, cordic matlab simulation algorithm.
-
-
0下载：
计算两个矩阵之间的欧氏距离，用于时频分析算法，多抽样率信号处理。- Calculation of the Euclidean distance between the two matrices, For time-frequency analysis algorithm, Multirate signal processing.
-
-
0下载：
非归零型差分相位调制信号建模与仿真分析 ，计算两个矩阵之间的欧氏距离，这是一个好用的频偏估计算法的matlab仿真程序。- NRZ type differential phase modulation signal modeling and simulation analysis, Calculation of the Euclidean distance between the two matrices, This is a useful frequency estimation algori
-
-
0下载：
空间目标识别，采用PM算法，基于欧几里得距离的聚类分析，相关分析过程的matlab方法。- Space target recognition algorithm using PM, Clustering analysis based on Euclidean distance, Correlation analysis process matlab method.
-
-
0下载：
1。实现，用C／C++和MATLAB，欧几里德算法计算最大公司（GCD）的两个任意多项式在GF（2）。模拟和分析两给定阶数不小(1.Realize, by using c/c++ or Matlab, the Euclidean algorithm to calculate the greatest common division (GCD) for arbitrary two polynomials over GF(2). Simulate and analyze the calculatio
-
