Space complexity的例句大全

This thesis analyzes the time and space complexity for algorithm.

本文分析了查询算法的时间复杂度和空间复杂度。

The algorithm we use has low time and space complexity, and has high parallelism.

所用算法具有较低的时间和空间复杂性，并有高度的并行性。

Give the formula approval of the time complexity and the space complexity, also prove the time complexity and the space complexity reduce to ( O ( kn)) by experiment.

给出了时间复杂度和空间复杂度的公式证明，通过实验证明该方法有效地降低了时间复杂度和空间复杂度（O（kn））。

Besides, some main characters of matrix link multiplication about asymptotic time complexity, space complexity and so on are analysed in detail.

分析和总结了矩阵链乘有关时间复杂度和空间复杂度等重要性质。

Performance analyses are developed aim at time and space complexity.

针对探测时间和空间复杂度等指标对算法进行了性能分析。

Its description, time and space complexity and contrasting experiment data are presented.

全文给出了该算法的描述，时间/空间复杂度分析和实验比较数据。

It is shown that our algorithm can be realized with lower time and space complexity and adjustable object detection error rate with comparison to other background subtraction algorithms.

与已有算法相比，该算法具有较低的时间、空间复杂度和可调的误检率。

The time and space complexity for generating one sentence is O ( r+ n), where n is the restricted length or depth of sentences and r is the number of productions in given CFG.

其生成一条句子的时间和空间复杂度是O（r+n），其中n是生成句子的长度或深度限制，r是给定上下文无关文法中产生式的数目。

This paper specifically demonstrates the discrete-marking principle, factors and the identified rule of self-adaptability discrete step criteria, and it also analyses the asymptotic time complexity and space complexity in auto-support generation algorithm based on discrete-marking method.

详细阐述了离散标识法的原理、影响因素、自适应性离散步长的确定准则，分析了离散标识法快速支撑生成技术的渐进时间复杂度和空间复杂度。

The asymptotic time complexity and better space complexity of this method of insertion sort are better than original ones.

这种插入排序算法不论时间复杂度还是空间复杂度，相对原2-路插入排序算法都有较好的改善。

However, the time and space complexity of support vector machine is a bottleneck in processing large-scale data.

但由于支持向量机方法复杂，导致在处理大规模数据集时存在相关问题。

But it is large in time and space complexity, it is restricted in practical.

而动态规划由于其时间和空间复杂度的庞大，在实际使用中受到了限制。

Methods for Reducing the Space Complexity of the Genera Resolution Principle

降低广义归结原理空间复杂度方法的研究

Additionally the algorithm has the optimal time and space complexity.

此外，这种算法具有最优的时间和空间复杂性。

It is mainly depend analysis of "Time Complexity" and "Space Complexity" to evaluate an algorithm in the before. The evaluation result is an algebraic expression with many parameters commonly.

以前的算法评估主要是基于时间复杂度和空间复杂度进行分析的，评估结果往往是一个含有多个参数的代数式。

In the system design, we adopt microcode control approach and pipeline processing, so as to make the time and space complexity low.

在系统设计中，采用了微程序控制方法和流水线技术。

Fast composite-event probability algorithm with both linear time and space complexity is proposed.

提出了一种可应用于电力系统充裕度分析的快速组合事件概率求取方法。

The time and the space complexity of the algorithm are lowest.

性能分析表明该算法具有最小的时间复杂度，并且在基于半边Z结构的情况下具有最小的额外空间复杂度。

However, the number of EPs in dense, dimensional datasets is huge which increases the time and space complexity.

然而，对于稠密数据集和高维数据集来说，EPs的数量巨大，因而增加了算法的时空复杂度。

Solving the first k out of a short path algorithm, and other short-path k-solving algorithm, this algorithm has better time and space complexity.

出了一个求解第k短路径的算法，和其它求解第k短路径的算法相比，本算法具有较好的时间和空间复杂度。