搜索资源列表
ojldqiuni
- 欧几里德算法求逆的源代码，短小精悍，只有几行！-Euclidean algorithm inverse of source code, short and pithy, but only a few are OK!
euclid
- 欧几里德算法和一些其他的简单功能。 求最大公约数之类-Euclidean algorithm and some other simple functions. Such as seeking common denominator
finitecal
- 本程序设计了一个有限域类，可以提供GF(P)[P为素数]上的矩阵运算，特别通过欧几里德算法提供了多项式的有限域矩阵逆运算。-This procedure designed a type of finite fields can be GF (P) [P for prime] on matrix calculation, in particular through the Euclidean algorithm provides a finite field polynomial matrix i
Euclidalgorithmandseekreciprocal
- 加密解密关于欧几里德算法以及欧几里德扩展算法（求倒数）的c源码 -Encryption and decryption on the extended Euclidean algorithm and Euclidean algorithm (demand reciprocal) c-source code
EUCLID
- 辗转欧几里得算法 求多项式逆 网路安全中的算法-Inverse polynomial Euclidean algorithm was removed network security algorithms
localization-RSSI
- 。通过对传统定位算法原理和误差来源进行分析，结合贝叶斯滤波概率模型对Euclidean定位算法进行 改进，使接收信号强度指示器随机波动得到有效的抑制。-. By traditional positioning algorithm principle and source of error analysis, probability model with Bayesian filtering algorithms to improve positioning of the Euclidean,
sdjfsl3
- 使用欧几里德算法计算：对e=6597，求出d，使得ed=1 mod 112-Using the Euclidean algorithm: for e = 6597, find d, so ed = 1 mod 11200
oujilide
- 广义欧几里得算法，用以计算两个数的最大公约数，依靠定理定理：gcd(a,b) = gcd(b,a mod b)-Generalized Euclidean algorithm for computing the greatest common divisor of two numbers, relying on Theorem Theorem: gcd (a, b) = gcd (b, a the mod b)
1-(a-b)
- 此程序为利用广义欧几里德算法求解最大公约数GCD-This procedure for the use of the generalized Euclidean algorithm for solving the greatest common divisor GCD
juggling
- 翻转算法，效果：abcdefg->defgabc 使用到辗转相除求最大公约数。-The Flip algorithm, the effect: abcdefg-> defgabc use to euclidean division of the common denominator.
a
- 辗转相除法，也叫欧几里得算法，是计算整数最大公因数的有效方法。本实验使用辗转相除法，通过编写一个C程序，让计算机来计算两个整数的最大公因数和最小公倍数，以及相应的参数s和t。-Euclidean algorithm, also called the Euclidean algorithm to calculate the greatest common divisor of integers effective way. Euclidean algorithm used in this expe
CommFactor
- 两种欧几里得算法求最大公约数，并写出它们的运行时间。-Euclidean algorithm for the greatest common divisor
cvEucdist
- 欧几里得距离是一种数学计算矩阵距离的算法，可用于图像分类时查找最近邻的距离。-Euclidean distance is a mathematical algorithm to calculate the distance matrix can be used for image classification when looking for the nearest neighbor distance.
math
- 提供欧几里得算法、扩展欧几里得算法、求素数算法、高斯消元算法-Provide the Euclidean algorithm, the extended Euclidean algorithm, the algorithm for prime numbers, Gauss elimination algorithm etc.
bingtou
- 最终的权值矩阵就是滤波器的系数，模式识别中的bayes判别分析算法，基于欧几里得距离的聚类分析。- The final weight matrix is ??the filter coefficient, Pattern Recognition bayes discriminant analysis algorithm, Clustering analysis based on Euclidean distance.
Euclid
- 用C语言使用欧几里德算法求任意两个正整数的最大公约数-Realize, by using c/c++ or Matlab, the Euclidean algorithm and the extended Euclidean algorithm to calculate the greatest common division (GCD) of any two positive integer numbers
taoqui_v64
- 基于欧几里得距离的聚类分析，借鉴了主成分分析算法（PCA），计算多重分形非趋势波动分析。- Clustering analysis based on Euclidean distance, It draws on principal component analysis algorithm (PCA), Calculate the multifractal trend fluctuation analysis.
fenpan
- 计算两个矩阵之间的欧氏距离，快速扩展随机生成树算法，用于建立主成分分析模型。- Calculation of the Euclidean distance between the two matrices, Rapid expansion of random spanning tree algorithm, Principal component analysis model for establishing.
qougei_v84
- 计算两个矩阵之间的欧氏距离，独立成分分析算法降低原始数据噪声，包括调制，解调，信噪比计算。- Calculation of the Euclidean distance between the two matrices, Independent component analysis algorithm reduces the raw data noise, Includes the modulation, demodulation, signal to noise ratio calculati
tailao
- Pisarenko谐波分解算法,计算两个矩阵之间的欧氏距离，可以广泛的应用于数据预测及数据分析。- Pisarenko harmonic decomposition algorithm, Calculation of the Euclidean distance between the two matrices, Can be widely used in data analysis and forecast data.