computational complexity的例句大全

Computational Complexity of KNA Algorithm Locating All Zeroes of Polynomials with Only Simple Zeroes

KNA算法计算单零点多项式全部零点的复杂性

Firstly, in order to reduced the computational complexity, the magnitude spectrum of CW is divided into basic matrix 、 transitional matrix and supplemental matrix.

首先，为了降低计算复杂度，将CW的幅度谱分块处理，分成基本矩阵、过渡矩阵和补充矩阵。

Then, the sampling rate alteration method based on FIR filter with FRM structure, its architecture, computational complexity and the problem in designing are studied.

并研究了基于此类FRM结构FIR滤波器的采样率变换算法、实现结构、计算复杂度及其设计问题等。

Based on the inequality and its corollaries, we design the conditioned BP algorithm, which can provide a good trade-off between the decoding performance and computational complexity.

基于所得模不等式及其推论，设计出可实现标准BP译码性能与计算复杂度折衷的条件BP算法。

For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。

The novel equalizer utilizes the pipelined architecture to reduce the computational complexity; uses the decision feedback structure of each module to remove the error remaining in the network. Moreover, it can also overcome the unstableness of IIR structure in nature.

该均衡器利用流水线型结构的模块化并行特点来降低计算复杂度；利用每个模块具有判决反馈结构来消除过去的残留在网络中的误差，同时，也能够克服由于本质上IIR结构存在的不稳定性。

The feature-based method uses the physical feature for image matching, such as edges, skeleton lines and corners. The computational complexity of this method is low, but it is only suitable for simple images with significant geometric features.

前者利用图像的物理特征，如边缘、骨架线条、角点等进行匹配，计算量比较小，但只对简单几何特征的图像效果比较好，对复杂图像的匹配效果并不理想。

But high computational complexity and huge storage capacity are its inherent defects.

但计算复杂和数据存储量大却是G.729算法的固有缺陷。

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

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

Label propagation algorithm ( LPA) is a fast community detection algorithm with near linear computational complexity.

标签传播算法（LPA）是一个著名的接近线性时间复杂度的快速非重叠社团发现算法，其算法过程非常简单明了。

And this strategy can make the computational complexity less than O ( nlogn).

这种策略使这种新算法的总的计算复杂度将到了O（nlogn）以内。

Relying on the theorem of Graham, the sample points are realized the minimal convex hull which computational complexity is O ( NlogN).

根据凸包生成算法原理，用Graham算法实现散乱样本的最小凸包，算法复杂度为O（NlogN）。

TSM-FMM reduces computational complexity to o ( NlogN) for sparse structures and to o ( N) for dense structures, from o ( N3) for the Gaussian elimination method and o ( N2) per iteration for the CG method.

运用这种方法，能把计算复杂度从高斯消元法的o（N~3）和CG法的o（N~2）减少到：对于稀疏结构的o（NlogN），对于稠密结构的o（N）；

With the strict analysis of the characteristics of homomorphic encryption, we realize that the reasonable using of this technology can reduce the computational complexity and communication complexity of multi-party computation.

通过对同态加密技术特点的深入分析，得知合理利用此技术可降低多方计算协议的计算复杂度与通信复杂度。

This model has a high recognition rate of 99.5% on ORL face database and a low computational complexity in comparison with other face HMMs.

这种模型在ORL人脸库上具有99.5%的识别率，而复杂度比已有的人脸隐马尔可夫模型小。

The computational complexity and dimension of matrices in computation are much lower than QR Decomposition Method, which is used now in power systems for the determination of dynamic stability.

这一方法比电力系统中现用的QR分解法优越，其运算量与矩阵运算阶次均大大低于QR分解法。

This paper affords detailed flow chart and estimation of the computational complexity which proves that general DSP ( Digital Signal Processors) can accomplish the real-time watermarking extraction.

文中给出了详细流程图，对算法复杂度的估计表明，使用现行通用DSP可以实现音频水印的实时提取。

Owing to the high computational complexity, it is quite difficult to solve hybrid flow shop scheduling problem exactly. Heuristic algorithms and intelligent optimization algorithms ( e.g.genetic algorithm) have been proved to be effective and practical to achieve near optimal solution of this problem.

由于高度的计算复杂性（NP-hard问题），混合流水车间调度问题很难求得最优解，启发式算法和智能优化算法（如遗传算法）求解此类问题的近优解的有效性和实用性已被证实。

The computational complexity on time and space of the proposed algorithm are both O ( n), which are both smaller than those of the classical algorithms.

该算法能快速有效地求解可分离连续凸二次背包问题的最优解，算法的时间复杂度和空间复杂度都是O（n），都比经典算法节约很多。

Wavelet domain hidden Markov tree ( HMT) model can well capture the statistical characteristics of wavelet coefficients, but the computational complexity of its training algorithm is high.

小波域隐Markov树模型（hidden Markov tree model，简称HMT）能充分表现小波系数的统计特征，但模型训练算法计算量大。