查询词典 algorithm of division

Image segmentation, to achieve the classic division algorithm, and the use of group Algorithm the division results.

在图像分割部分，实现了经典的分合算法，并且使用成组算法改进了分合的效果。

Compared several algorithm of division of mainstream computer.

比较了当今主流处理器中除法器的几种算法，通过分析，得知SRT运算的硬件结构简单、面积小、功耗小。

This paper proposes an algorithm of division and multi-level clustering with multi-strategy optimization,which bases on study of today's mature algorithms.

本文在研究已有成熟算法的基础上，提出了基于分治多层聚类的话题发现算法，其核心思想是把全部数据分割成具有一定相关性的分组，对各个分组分别进行聚类，得到各个分组内部的话题，然后对所有的微类再进行聚类，得到最终的话题，在聚类的过程中采用多种策略进行优化，以保证聚类的效果。

Real AdaBoost algorithm demands division of the sample space. The traditional finite division can not reflect the distribution of positive and negative samples.

连续AdaBoost算法要求对样本空间进行划分，传统的等距划分无法体现正负样本各自的分布规律。

This paper discusses some algorithm of division and square root. Inmy design, I use improved Newton algorithm for square root and Goldschmidt al-gorithm for division.

本文探讨了当前使用较多的一些浮点除法/开方算法，并在设计中采用了改进的牛顿迭代来计算开方、使用 Goldschmidt 算法来实现除法。

Finally we also discuss the algorithm of syllable division, correcting algorithm, multithread algorithm and algorithm dealing with the rules of vowel and consonant harmony and the final vowel change in the Uyghur language.

此外，本论文叙述了分音节算法，替换算法，多线程处理算法"语音的和谐"处理算法和"语音的同化"处理算法等关键性的算法。

And it comparatives and analyses the efficiency of three algorithm's cliping through an example, the example proved: Liang－Barsky algorithm efficiency is highest, Cohen-Sutherland next best, and the midpoint of division algorithm efficiency is lowest.

并通过一个实例对三种算法的裁剪效率比较分析，实例证明：梁友栋一Barsky算法效率最高，Cohen—Sutherland次之，而中点分割算法裁剪效率最低。

Any graph's cliping attributes to line cliping finally.It commonly used three kinds of line segment cliping algorithms that mainly included the Cohen-Sutherland algorithm, the midpoint of division algorithm and Liang－Barsky algorithm.

任何图形的裁剪最终都归结于直线段裁剪，常用的直线段裁剪算法主要有Cohen—Sutherland算法、中点分割算法及梁友栋一Barsky算法三种。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

Finally we also discuss the algorithm of syllable division, correcting algorithm, multithread algorithm and algorithm dealing with the rules of vowel and consonant harmony and the final vowel change in the Uyghur language.

此外，本论文叙述了分音节算法，替换算法，多线程处理算法&语音的和谐&处理算法和&语音的同化&处理算法等关键性的算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。