适用欧几里德算法来计算7735和4185的最大公约数。
Use Euclid's algorithm to compute the greatest common divisor of 7735 and 4185.
本文基于欧几里德算法，给出了一种能判别系统模型中相似零极点的新方法和近似度的新概念。
Based on Euclidean algorithm, this paper gives a new method that can judge similar zero and pole points of a system model and conception of similarly.
在我自学的过程中，我已经学过一些简单的算法比如，欧几里德法则并且这个法则帮助了我写了第一个程序，小数计算器。
During the course of self-studying, I have learnt some simple algorithms such as Euclid algorithm which helped me create my first program, fractional calculator.
传统的K-均值算法选择的相似性度量通常是欧几里德距离的倒数，这种距离通常涉及所有的特征。
The Euclidean distance is usually chosen as the similarity measure in the conventional K-means clustering algorithm, which usually relates to all attributes.
传统的K-近邻算法选择的相似性度量通常是欧几里德距离的倒数，这种距离通常涉及所有的特征。
The Euclidean distance is usually chosen as the similarity measure in the conventional K-NN algorithm, which usually relates to all attributes.
本文给出了实现RSA的快速算法，包括寻找大素数和欧几里德的快速实现。
This paper gives a fast arithmetic for the RSA which includes finding the big prime number and the fast Euclid.
对比了两种模逆算法，从节约时间的角度选取了扩展的欧几里德方法。
Extended Euclidean Algorithm is selected to realize inversion from the standpoint of saving time.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
应用推荐