• The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.

    方法关于数据库大小属性个数具有近似线性时间复杂度使得算法具有好的扩展性

    youdao

  • The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.

    针对LDPC码通用编码算法复杂度长的方成正比问题,重点研究LDPC码的快速编码方法,总结出了使LDPC码能够达到线性编码的途径。

    youdao

  • An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method (ETCM) is proposed, which has a linear time complexity.

    本文提出一种改进细分嵌入算法——端点外接圆(ETCM),算法具有线性时间复杂度

    youdao

  • 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.

    方法有效地避免了一般复用距离分析可能导致内存溢出问题同时使得复用距离分析达到线性时间复杂度

    youdao

  • To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.

    为了解决这个问题本文提出一种新的模式合一算法,共时间复杂度线性的。

    youdao

  • Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.

    给出线性八叉树平移旋转算法它们都有线性时间复杂性

    youdao

  • Linear octree encoding provides a effective way for tridimensional of objects. Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.

    线性编码一种有效表示三维物体方法给出了线性八叉树的平移旋转算法它们都有线性时间复杂性

    youdao

  • The conversion algorithm between LDST and linear quadtree and its time complexity analysis are also studied at the end of the paper.

    最后本文还给出了LDST线性之间转换算法时间复杂度分析

    youdao

  • 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.

    异常检测方法关于数据大小属性个数具有近似线性时间复杂度适合大规模数据集。

    youdao

  • The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.

    理论分析表明算法时间复杂性接近于线性复杂度。

    youdao

  • It testified that linear space algorithm based on parallel computing is superior to classical linear space algorithm in time complexity.

    证明基于并行计算线性空间算法进行长序列比对,时间复杂性优于经典的线性空间算法。

    youdao

  • Focusing on the problem that existing linear dispersion (LD) space-time codes have a high encoding and decoding complexity, a type of orthogonal linear dispersion (OLD) space-time codes is proposed.

    针对输入多输出系统中现有线性分散(LD)解码复杂度问题,提出了一类正交线性分散(old)空时编码

    youdao

  • The research of detection of outliers in the linear regression model has been a hot topic all the time for the complexity of the real data.

    由于实际数据复杂性,使得识别回归模型异常研究工作一直是个热点

    youdao

  • 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算法相当。空间复杂度顶点数具有线性关系

    youdao

  • 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算法相当。空间复杂度顶点数具有线性关系

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定