传统支持向量机的时间空间复杂度和样本个数有关，样本个数大时，将产生时间空间上的巨大耗费。
Time and space complexity of traditional support vector machine is relevant to the number of samples, when the number of samples is large, there will be a great time and space use.
什么是时间复杂度和空间复杂度的字典？
分析了事务与关联规则在二进制序列集中的表示方法及其在空间、时间上的复杂度。
It analyzes the express method of affair and association rule in the binary system sequences set and complexity in space and time.
实验证明该算法的时间和空间复杂度都在可接受的范围。
The experiment proved that the time and spacial complexity of the algorithm is acceptable.
可是由于概念格自身的完备性，构造概念格的时间、空间复杂度一直是影响形式概念分析应用的主要障碍。
However, because of the specialty of self-contained, the time and space complexity of building concept lattice has always been one of the main obstacles that restrict it from being applied.
线性扫描算法的应用使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.
针对原有算法，本文提出了优化算法，大大改善它的时间和空间复杂度。
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.
基于该算法的系统在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.
有效减少时间和空间复杂度，提高算法的效率。
And then complexity of time and space was efficiently reduced far and away, and efficiency of algorithm was improved.
理论上给出了算法的流大小的无偏估计，相对误差的上界以及时间和空间复杂度。
Unbiased estimation of flow size, the upper bound of relative error and the time and space complexity are deduced theoretically.
同时，优化中还包括降低计算复杂度的查询裁剪的优化，以及兼顾空间和时间开销的查询结果合并方式。
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.
它解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度与空间复杂度的比较，证明此算法更加简单快捷。
It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.
由于是针对小文本的数据挖掘，本文研究的算法时间和空间复杂度都不高，因此有望成为一种实用、有效的信息检索技术。
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.
时间复杂度和空间复杂度过大的问题。
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
因为对二元互补序列偶的搜索涉及到四个序列的计算，搜索的时间复杂度和空间复杂度很大。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
你应当最优化时间和空间复杂度。
他解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度和空间复杂度的比较，证明此算法更加简便快捷。
It solve the negative credentials, compared with the time and space complicated degree of the original algorithm, prove the algorithm more simple and shortcut.
对其时间和空间复杂度的分析，以及对一个气象决策表例子的实验结果，证明了这些方法的有效性。
An efficiency of the proposed methods was illustrated by time and space complexities analysis and experimental result in a weather decision table.
实践表明，这种基于复合加密的公钥密码系统，算法的时间复杂度和空间复杂度并未受到影响，但其安全性较早期各同类系统更高、更易被用户采纳。
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.
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
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.
出了一个求解第k短路径的算法 ，和其它 求解第k短路径 的 算法相比，本算法具有较好的时间和空间复杂度。
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.
由于本算法具有较小的时间复杂度和空间复杂度，可应用于实际生产与生活。
This algorithm has smaller time complexity and space complexity, so can be applied in practical production and life.
我们证明了CLAR- LASSO的有限收敛性，并分析了它的时间复杂度和空间复杂度。
We prove the finite convergence of CLAR-LASSO and analyze its time and space complexity.
该文提出一种基于重叠区的3阶段改进算法，该算法将大大减少算法的时间复杂度和空间复杂度。
This paper proposes a 3-phase algorithm based on overlapping partitions to reduce the time and memory requirement.
同时该算法的时间复杂度和空间复杂度均低于采用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.
算法应该满足线性时间复杂度和O(1)空间复杂度。
实验结果表明，在时间复杂度、空间复杂度不高于其他算法的前提下，该方法能降低估算误差率。
Experimental results show that when the time complexity and space complexity is not higher than other algorithm, this method can reduce estimation error rate.
应用推荐