同时我们也会讨论其它重要资源的测度，比如算法的空间复杂度。
We will also discuss the other important resource measure , namely the space required by an algorithm.
在实际应用中，动态规划算法的空间复杂度是限制问题规模的瓶颈。
In practical application, the spacial complexity of algorithm is the bottleneck of problem's scale.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
在第二章中，提出了把参数算法应用于生物计算，以减少生物计算的空间复杂度的思想。
The idea to use parameterized algorithm to deduce the space complexity of DNA computing is given in the second chapter.
论文提出的一种基于比特翻转和减小搜索空间的算法，在不增加系统复杂度的情况下，可以比较明显地提高捕获速度。
In this paper, a new strategy based on search space reduction and bit reversal algorithm is proposed, which could magnificently improve the speed of acquisition without additional complexity.
提出了基于宏块空间复杂度的宏块类型判断算法，有效地降低了视频压缩算法的计算复杂度。
Macro Block (MB) type judging algorithm is proposed based on MB′s space complexity. It reduces effectively the computational complexity of the video compression.
实验证明该算法的时间和空间复杂度都在可接受的范围。
The experiment proved that the time and spacial complexity of the algorithm is acceptable.
它解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度与空间复杂度的比较，证明此算法更加简单快捷。
It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.
提出了一种新的基于子空间跟踪(SP)的自适应多用户检测算法，不需计算初始矩阵，并且检测性能接近高复杂度的经典算法。
A new adaptive multi-user detector based on subspace tracking (sp) was proposed, which doesn't need initial matrix and has similar performance as classic algorithm with large computational complexity.
实践表明，这种基于复合加密的公钥密码系统，算法的时间复杂度和空间复杂度并未受到影响，但其安全性较早期各同类系统更高、更易被用户采纳。
It is proved that this public key cryptosystem based on compound encryption has not been influenced on time complexity and space complexity, but it has more security t.
线性扫描算法的应用使TTA编译器具有生成目标代码质量高、算法的时间和空间复杂度低、易于实现等优点。
The application of this algorithm makes TTA compiler so many advantages, such as the quality of code obtained is high, time and space complexity is low, and implementation is easy.
他解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度和空间复杂度的比较，证明此算法更加简便快捷。
It solve the negative credentials, compared with the time and space complicated degree of the original algorithm, prove the algorithm more simple and shortcut.
针对原有算法，本文提出了优化算法，大大改善它的时间和空间复杂度。
In this paper, optimal algorithms are put forward, and can greatly reduce space and time complexity degree of previous algorithms.
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
有效减少时间和空间复杂度，提高算法的效率。
And then complexity of time and space was efficiently reduced far and away, and efficiency of algorithm was improved.
由于本算法具有较小的时间复杂度和空间复杂度，可应用于实际生产与生活。
This algorithm has smaller time complexity and space complexity, so can be applied in practical production and life.
又由于采用了核函数思想，使它把非线性空间的问题转换到线性空间，降低了算法的复杂度。
Moreover, by using the kernel function idea, this theory can change the problem in non-linearity space to that in the linearity space in order to reduce the algorithm complexity.
基于该算法的系统在TDT4中文语料上进行了测试，结果表明该算法属于目前结果最好的算法之一，并显著降低了算法的时间和空间复杂度。
The system implemented with the algorithm has been tested on TDT4 corpus and got satisfactory results while reducing time and space complexity of algorithm remarkably.
该文提出一种基于重叠区的3阶段改进算法，该算法将大大减少算法的时间复杂度和空间复杂度。
This paper proposes a 3-phase algorithm based on overlapping partitions to reduce the time and memory requirement.
基于子空间的盲多用户检测将接收信号投影到信号子空间，可以提高检测性能，并且可采用复杂度较低的子空间追踪算法实现。
The performance of subspace method is improved by projecting the received signals to the signal subspace. And it can be executed by subspace tracking algorithms with low computational complexity.
理论上给出了算法的流大小的无偏估计，相对误差的上界以及时间和空间复杂度。
Unbiased estimation of flow size, the upper bound of relative error and the time and space complexity are deduced theoretically.
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.
由于是针对小文本的数据挖掘，本文研究的算法时间和空间复杂度都不高，因此有望成为一种实用、有效的信息检索技术。
Since aims at small texts data mining, its complexity of time and space is not high. So it can be said this algorithm will become one kind of practical and effective information retrieval technology.
同时该算法的时间复杂度和空间复杂度均低于采用JBIG标准来压缩二值图像。
Moreover, the complexity of both the time and space to compress binary images is lower than that got by using JBIG standard.
我们应该寻找一种新算法降低时间复杂度和空间复杂度，以使LS A方法能够更好的应用于大规模的文本处理。
We should seek a new computation to reduce the complexity so as to apply LSA to cosmically context processing.
针对上述情况，提出了通过局部空间变换的方法，简化直线段之间的求交过程，且在一定程度上可降低算法的复杂度，提高算法的效率。
Our study established a method called "Local space transform", can simplify the procession of intersection between line segments, improve the efficiency and decrease the complicacy.
提出了一种针对3d离散数据点的空间三角网格生成算法，该算法具有接近线性的复杂度，并有效地解决了一般算法不能处理的带有孔洞表面的情况。
A fast triangulation algorithm for 3d scattered data is presented. The algorithm has almost liner complexity and can effectively solve the region with holes that common algorithm can not dispose.
实验结果表明，在时间复杂度、空间复杂度不高于其他算法的前提下，该方法能降低估算误差率。
Experimental results show that when the time complexity and space complexity is not higher than other algorithm, this method can reduce estimation error rate.
该算法复杂度低，并行性好，支持高速低功耗硬件实现，能实现对空间数据的实时处理，在空间探测领域具有良好的应用前景。
The algorithm has lower complexities and good parallel architecture, and is suitable for the high-speed low-power hardware realization and real-time processing.
经性能分析可知，本算法的时间复杂度和Dijkstra算法相当。空间复杂度与顶点数具有线性关系。
The performance analysis shows that the time complexity of this algorithm and the Dijkstra algorithm. Space complexity of a linear relationship with the top points.
应用推荐