algorithm complexity的例句大全

Accordingly, a FIR filter based on frequency response masking technique is introduced into the design of digital down-converters, its efficient implementation architecture is given and the complexity of the algorithm are studied thoroughly.

该文将基于频率响应屏蔽（FRM）方法的FIR滤波器引入到数字下变频器设计中，并详细地研究了此类数字下变频器的高效实现结构和算法复杂度。

The average search complexity of BB algorithm is lower than that of the stack algorithm.

分枝定界算法的搜索平均复杂度低于堆栈算法，同时改进算法加快了收敛速度，降低了计算复杂度和对存储空间的要求。

To reduce the complexity of intra prediction, a fast intra-prediction mode selection algorithm is proposed.

针对帧内预测编码的复杂性,本文提出一种基于率失真优化(RDO:Rate Distortion Optimization) 的快速帧内预测模式选择算法.

Then the DCBF algorithm is described in detail, with the correctness of DCBF proved and the computing complexity of DCBF analyzed. Finally an example is given.

详细描述了DCBF算法，证明了DCBF算法的正确性，分析了DCBF算法的计算复杂度，并给出了一个实例。

Compared to the Bayesian algorithm, the resulting image of the proposed algorithm is smooth with sharp edges, while computational complexity and memory buffer are quite reduced.

所构造的逆半调算法与Bayesian算法相比，逆半调图像平滑且边缘清晰，时空复杂度大大降低。

Secondly, we discuss the complexity any algorithm solving RHC presents by counting the moving times of the tape head on turning machine.

在此基础上，通过分析通用图灵机带头移动的次数，讨论了通用图灵机上任一求解RHC的算法的复杂性。

The time complexity of the algorithm isO ( Lnd~ 2/ 2).

该算法的复杂度为O（Lnd~2/2），当dn时，算法具有线性复杂度。

The simulation results show that this algorithm can not only construct delay-constrained multicast tree correctly, but also has a less cost and a lower computational complexity than KPP.

仿真结果表明，该算法能正确地构造出时延约束组播树，同时还具有较低的代价和计算复杂度。

The security of the algorithm is mainly based on the difficulty of RSA crack, and the complexity of the algorithm is based on matrix transformations and quadratic function operations.

此算法的安全性主要是基于RSA破解的难度，而算法复杂度基于矩阵变换与基础二次函数运算。

First several basic algorithms of Rough set methods are introduced with an analysis of the time complexity such as some efficient and incremental computing of indiscernibly relation and an improved algorithm of positive region.

具体研究工作如下：一.在Rough集的基本算法方面，提出了计算等价类的快速算法和增量算法以及计算正区域的改进算法，分析了算法的时间复杂度；

Based on Global Wavelet Penalty, a new gradient-based ILT algorithm is proposed for mask complexity reduction.

基于全局小波惩罚项，本文提出了一个新的反向光刻算法用于降低版图复杂度。

We present the concept, the algorithm and the complexity of Roll-Up.

提出了关联规则上探及相关的概念，并在此概念的基础上给出了上探的算法及复杂度分析。

The new algorithm decreases the computational complexity greatly , and increases the accuracy ofestimation greatly.

新算法降低了计算量, 提高了频偏估计精确度.

Compared to the conventional weighting iterative algorithm, the proposed algorithm not only has better performance and can apply to a wide scope of linear block codes, but also can make a compromise decision between the complexity and decoding performance.

比较其他同类算法，该算法不仅性能较好、适用码型范围较广，而且可以根据具体情况在译码复杂度和译码性能两者之间做出折衷选择。

Next, since the computation complexity of the proposed algorithm is relatively large, an improvement is made in the model of the scheduler and some strategies in reducing the scale of the second sub-problem are employed. Also we parallelize the proposed algorithm.

然后，针对所提出的方法存在的一些问题，改进了调度器模型同时对存储资源选择问题进行了规模上的缩减，并对算法做了并行处理、。

With respect to the inherent NP-hard complexity of vehicle routing problem, a predatory search algorithm simulating animal predatory strategies was designed.

针对车辆路径问题存在的NP难题，设计了一种模仿动物捕食策略的捕食搜索算法进行求解。

There is a pseudo-polynomial algorithm with complexity O ( nM~ k) for dynamic knapsack problem.

对动态背包问题给出了时间复杂性为O（nM~k）的拟多项式算法。

The KSP algorithm can avoids the high computational complexity cost by large amount of constraints in hierarchical SVM.

该算法避免了层次化支持向量机非常多的约束所带来的计算上的代价。

As to the complexity of RFI, a Gradual RELAX ( GRELAX) algorithm is proposed.

针对RFI的复杂性，提出了一种逐级RELAX算法（GRELAX）。

This paper discusses the knight tour problem. A divide& conquer backtracking merge algorithm is presented for searching the Hamilton cycles of the problem. Its time complexity is O ( n 2).

本文对骑士巡游问题进行了研究，提出了求棋盘马步图的Hamilton圈的分治-回溯-合并算法，其时间复杂度是O（n2）。