Description: 扩展欧几里德算法不但能计算(a,b)的最大公约数，而且能计算a模b及b模a的乘法逆元。平方和乘算法的复杂度：执行次数至少要k次模乘，最多需要２ｋ次模乘。-Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the complexity of algorithm: the implementation of at least k times the number of modular multiplication, up to 2k times by mode. Platform: |
Size: 1024 |
Author:俞佳 |
Hits:
Description: NDtw
====
Dynamic Time Warping (DTW) algorithm implementation for .NET C#
Features
====
* Single or multivariate
* Data preprocessing options (none, centering, normalization, standardization)
* Optional weights for variables
* Manhattan, Euclidean, SquaredEuclidean distance measures
* Optional boundary constraints (1, 1) and (m,n)
* Sakoe-Chiba band
* Ikatura paralelogram (custom slope constraint can be specified which results in such paralelogram)
* C# code written with performance in mind (fast data structures, local variables caching for loops etc.) Platform: |
Size: 2313216 |
Author:graf |
Hits:
Search - Euclidean algorithm in c implementation