你的算法应该满足线性时间复杂度。
你的算法应该在一个线性时间复杂度完成。
算法应该满足线性时间复杂度和O(1)空间复杂度。
基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。
Based on the algorithm to find strongly connected nodes of a graph, this paper presents a linear time algorithm to detect modules of a fault tree.
该方法关于数据库的大小、属性个数具有近似线性时间复杂度，这使得算法具有好的扩展性。
The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.
该异常检测方法关于数据集大小和属性个数具有近似线性时间复杂度，适合于大规模数据集。
The time complexity of the detection approach is nearly linear with the size of dataset and the number of attributes, which results in good scalability and adapts to large dataset.
本文提出了一种改进的细分嵌入算法——端点外接圆法(ETCM)，该算法具有线性时间复杂度。
An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method (ETCM) is proposed, which has a linear time complexity.
该方法有效地避免了一般复用距离分析可能导致的内存溢出问题，同时使得复用距离分析达到线性时间复杂度。
This method avoids possible memory overflow problem in normal reuse distance analysis, at the same time this method makes complexity of reuse distance analysis decrease to linear.
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
最后，本文还给出了LDST与线性四叉树之间的转换算法及时间复杂度分析。
The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.
线性扫描算法的应用使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.
通过形式化描述和分析CSCM机制的系统模型和运行模型，证明了CSCM具有一阶线性的消息复杂度和收敛时间。
By formalizing description of system model and running model of CSCM mechanism, the usability and extensibility of the system is given, and the message complexity and convergence time is proved.
理论分析表明，该算法的时间复杂性接近于线性复杂度。
The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.
理论分析和实验结果表明该算法的时间复杂度和视角数目呈线性关系。
Both theoretical analysis and experimental results show that the time complexity of the proposed algorithm is increased linearly with the number of viewpoints.
局部线性嵌入(LLE)算法是有效的非线性降维方法，时间复杂度低并具有强的流形表达能力。
The Locaally linear Embedding (LLE) algorithm is an effective technique for nonlinear dimensionality reduction of high-dimensional data.
经性能分析可知，本算法的时间复杂度和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.
经性能分析可知，本算法的时间复杂度和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.
应用推荐