由于检测对DC序列进行，算法计算时间复杂度比较低。
Since the detection is carried out on DC sequence, the computation complexity of this method is relatively low.
结果证明，本文的算法具有良好的视差计算准确性和较低的计算时间复杂度。
The experiment result proves that this strategy can get good accuracy disparity image.
实验对比表明，这种改进的灰度对比度函数，计算时间复杂度较简单，对焦灵敏度高。
The comparison shows that the improved gray scale contrast function has simpler time computational complexity and higher focusing sensitivity.
该分解算法的计算时间复杂度远小于经典粗糙集约简算法的计算时间复杂度，在提高计算速度的同时不会损失信息量。
Time complexity of this decomposition algorithm is far less than the classical reduction method in RST, speed of calculation is raised and information are not loss.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
并提出了一种新的计算有限容量闭合排队网络系统边界性能的分析方法APBA法，和其他近似分析方法相比，APBA法的计算时间复杂度更低。
In order to cope with the state space explosion problem of CQN-FC solution, a novel approximate performance bounds analysis (APBA) method is proposed, which ha.
目前的数学理论和计算实践显示，自然语言处理所需要的时间随输入信息的复杂度呈指数增长。
The current mathematic theory and calculation practices indicate that the time needed to process language information increases with the complexity of the input information exponentially.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
给出一个算法计算n ！，分析它的时间复杂度。
Give an algorithm to compute n! And analyze its running time.
另外，还通过计算机实验，对置乱网络的遍历时间复杂度及其置乱性质进行了分析。
The paper also analyzed the time complexity and the scrambling performance of the new networks by computer experiments.
同时，优化中还包括降低计算复杂度的查询裁剪的优化，以及兼顾空间和时间开销的查询结果合并方式。
Meanwhile, the optimization also includes reducing the computational complexity of the query optimization of trimming, and query results combination which considered both space and time cost.
该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
The computing complexity and computing time of this algorithm is lower than that of existed algorithms.
因为对二元互补序列偶的搜索涉及到四个序列的计算，搜索的时间复杂度和空间复杂度很大。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
An algorithm for determining the perspective view of a set of disjoint simple objects in the plane on a two-dimensional mesh computer is presented with its time complexity given.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 -OPT算法计算时间的平均复杂度。
The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
在基于时间的无线定位系统中，时间估计算法的精度和复杂度是衡量系统性能的关键因素。
In the Time-based Radio Location system, the precision and complexity of the time estimation algorithm are the key factors that affect the system performance.
在减少计算时间方面：提出了一种减少时空复杂度的类似快速排序的周游方案；
To the computation time end, a new quick-sort-like path construction method is proposed, which have smaller computation complexity;
提出了一种利用均值加速的快速中值滤波算法，它能有效地降低中值滤波算法的时间复杂度，将计算效率和运算速度提高到传统快速滤波算法的两倍以上。
This paper presents a fast median filtering algorithm which analyzes neighborhoods to accelerate calculation of the median value of the set by using the mean value.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
负载的涨落是在无限处理能力的假设下计算的。算法在平均负载的计算上进行扩展，但避免了时间复杂度的增加。
The fluctuations are calculated with the assumption of unlimited resources, where the calculation is incorporated into the calculation of the average loads without adding to the time complexity.
将滑动相关的时间分辨率与传统相关MUSIC方法的计算复杂度进行了对比。
Comparison of time resolution and complexity between sliding correlation method and conventional correlation MUSIC method was conducted.
由于盲信道估计算法复杂度高，收敛时间长且存在信号或符号的不确定问题，不适于在实际中应用，因此本文主要研究的是基于导频的信道估计。
Because of the high algorithm complexity, the slow convergence and the signal or symbol obscure problem of the blind channel estimation, it is not suitable in practical use.
由于盲信道估计算法复杂度高，收敛时间长且存在信号或符号的不确定问题，不适于在实际中应用，因此本文主要研究的是基于导频的信道估计。
Because of the high algorithm complexity, the slow convergence and the signal or symbol obscure problem of the blind channel estimation, it is not suitable in practical use.
应用推荐