The spatial complexity is always O ( n) for all cases.

The algorithms whose time complexity is 1. 675 × H × V × T and space complexity is 6 × H × V can fully meet the requirement for the embedded system.

本算法时间复杂度为1.675×H×V×T、空间复杂度为12×H×V，能充分满足嵌入式系统的要求。

互联网摘选

Characteristic number of inertia moment of gray level co-occurrence matrix can reflect the feature of complexity of image gray space. Optimum space coefficient of LOG operator can be ac-quired effectively and most noise of images can be removed.

通过纹理分析，利用灰度共生矩阵惯性矩特征值能够反映图像灰度空间复杂度的特性，成功获取了LOG边缘检测算子最佳空间系数，抑制了图像中的大部分噪声。

互联网摘选

However, FP-growth algorithm can not mine effectively the large databases, moreover, the Time-complexity and the space-complexity is to high.

但是FP-growth算法并不能有效的挖掘大型数据库，并且时间和空间复杂度较高。

互联网摘选

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短路径的算法相比，本算法具有较好的时间和空间复杂度。

互联网摘选

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））。

互联网摘选

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 proposes a quarter-pixel interpolation method named as Two Steps Four Taps interpolation ( TSFT), compared with interpolation method in H.264, 11% spatial complexity is reduced, computation complexity and average SNR is about the same.

文中提出了一种低空间复杂度1/4像素插值方法两步四抽头插值法（Two Steps Four Taps Interpolation，TSFT），该方法与目前国际上最先进的视频编码标准H。

互联网摘选

Compared to "based on permutation" enumeration algorithm, it increase a O ( n) storage space.

相比较基于排列的枚举算法，本算法在空间复杂度上，增加了O（n）的存储空间。

互联网摘选

We should seek a new computation to reduce the complexity so as to apply LSA to cosmically context processing.

我们应该寻找一种新算法降低时间复杂度和空间复杂度，以使LSA方法能够更好的应用于大规模的文本处理。

互联网摘选

The parameterized string matching method proposed by Baker can detect duplicated blocks. However, its ability to solve problem is limited for the space complexity.

Baker提出的参数化匹配方法能检测出方法级以下的重复代码，但它的空间复杂度要求过高，限制其能解决问题的范围。

互联网摘选

The new algorithm only needs an array whose size is n, so the space complexity is O ( n).

新算法仅需要一个大小为n的一维数组，空间复杂度为O（n）。

互联网摘选

In view of the fact that ventilation simulation system that has certain requirements on real time property should satisfy the spatio temporal complexity, it is proposed to use a multi agent based system.

针对实时性有一定要求的通风仿真系统中必须满足的时间和空间复杂度要求，提出了一种基于多Agent系统的分析和解决方案。

互联网摘选

For how to construct a MIB tree, we propose two algorithms, and the two algorithms time complexity and space complexity of a detailed analysis and comparison.

对于如何构造MIB树，论文提出了两种算法，并对这两种算法的时间复杂度和空间复杂度做了详细的分析和比较。

互联网摘选

Access control is the key problem in a hierarchy system. An access control scheme based on Lagrange's interpolation polynomial is proposed, and the property is analyzed from the view of time and space complexity.

本文基于Lagrange插值多项式，提出了等级系统中的一个访问控制方案，并从空间复杂度和时间复杂度角度分析了其性能。

互联网摘选

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），都比经典算法节约很多。

互联网摘选

The space complexity of the algorithm is only O ( n) while the time complexity approximates to O ( n2? logn).

该算法的空间复杂度仅为O（n），时间复杂度近似为O（n2·logn），且预测结构有较好的精度。

互联网摘选

And it optimizes these steps of re-sampling, calculating weight and MCMC algorithm on the software implementation, which greatly reduces the space and time complexity of algorithm.

其在软件实现上改善了重采样策略，权值计算步骤以及MCMC步骤，大大降低了算法空间复杂度与时间复杂度。

互联网摘选

And its time complexity is O ( m' D' log n).

且算法的时间复杂度为O（m｜D｜log N）。

互联网摘选

The result of our tests explains that the algorithm to solve the triangles packing problem by using personification approach is of high efficiently and low complexity.

实验结果表明，沿此途径得出的求解三角形Packing问题的算法，针对三角形数目较多的情况，具有较好的完整性和较低的时间复杂度。

互联网摘选

All these algorithms run in O ( logn) time using O ( n) processors, where n is the number of vertices in the tree.

对n个顶点的树，以上算法均使用O（n）个处理机，时间复杂度为O（logn）。

互联网摘选