为了减少块匹配过程中每个待匹配位置的运算次数,保持块匹配的精度,又引入了连续排除算法,降低了计算复杂度。
In order to reduce the calculation number of matching position and keep the precision, we make use of the successive elimination algorithm. Therefore, the complexity was reduced.
此算法通过引入有符号和无符号滑动窗口编码方法,大大减少了标量乘算法中费时的加法运算次数。
This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.
引入了“可达矩阵”的概念,利用可达矩阵计算出了公交线网的平均换乘次数,并给出了算法。
Moreover, introduce the idea of reachability matrix, by which, figure out the average transfer times and come out the arithmetic.
为了减少随机抽样的次数并保证蒙特卡罗法的数值模拟精度,对比引入了重要抽样法和拉丁超立方体抽样方法;
To reduce sampling number and assure simulation precision, Importance Sampling method and Latin Hypercube Sampling method are coupled with Neumann expansion SFEM respectively.
引入了交易时间和交易规模、交易次数等因素来进行信任值的计算,利用惩罚项来限制交易节点提供恶意服务。
Transaction time factors, transaction scales, and transactions number are introduced to calculate the trust value. Penalty item is used to limit node to provide malicious service.
在环间相交交点的求取过程中,引入包围盒技术对可能存在相交的线段进行初次筛选,减少了线段相交性判断的次数。
In the process of intersection calculating among different loops, rectangular bounding box was used to find the curves which had the chances for intersecting.
在环间相交交点的求取过程中,引入包围盒技术对可能存在相交的线段进行初次筛选,减少了线段相交性判断的次数。
In the process of intersection calculating among different loops, rectangular bounding box was used to find the curves which had the chances for intersecting.
应用推荐