空间复杂度的英文

• computational complexity theory
• space complexity

• "空间"英文翻译    space; enclosure; room; blan ...
• "复杂"英文翻译    complex; complicated
• "度"英文翻译    surmise; estimate
• "时间空间复杂度" 英文翻译 :    time space complexity
• "时间复杂度" 英文翻译 :    computational complexity theory; time complexity
• "空间复杂型" 英文翻译 :    spatial complex
• "空间复杂性" 英文翻译 :    space complexity
• "时间复杂度性函数" 英文翻译 :    time complexity function
• "红黑树的时间复杂度为" 英文翻译 :    stl
• "复杂度" 英文翻译 :    complex rate; order of complexity; space complexity
• "时间复杂性" 英文翻译 :    time complexity
• "带复杂度" 英文翻译 :    tape complexity
• "复杂度类" 英文翻译 :    complexity class
• "复杂度理论" 英文翻译 :    computational complexity theory
• "复杂度系数" 英文翻译 :    complexity factor
• "化学复杂度" 英文翻译 :    chemical complexity
• "计算复杂度" 英文翻译 :    computational complexity theory
• "圈复杂度" 英文翻译 :    cyclomatic complexity
• "循环复杂度" 英文翻译 :    cyclomatic complexity
• "询问复杂度" 英文翻译 :    query complexity degree
• "空间复原" 英文翻译 :    palinspastic reconstruction
• "等效门复杂度" 英文翻译 :    equivalent gate complexity
• "空间复用协议" 英文翻译 :    srspatial reuse protocol
• "夜间复杂气象飞行" 英文翻译 :    night ifr flight
• "昼间复杂气象飞行" 英文翻译 :    daylight ifr flight

• In the end of this part , the complexity in time and space of the algorithm is analyzed
  对算法的时间复杂度和空间复杂度进行了分析。
• A new detection hole counting algorithm is developed , with sound time and space complexity
  论文第一次提出了rcb检测规则下的检测漏洞计量算法，其时间复杂度和空间复杂度都较为合理。
• Compared with dp algorithm , safss is an algorithm with lower space complexity and has high performance
  与dp算法相比, safss显著降低了算法的空间复杂度,减少了计算量,具有较好的性能。
• By using the proposed method the correlation between two stocks can be computed in limited memory
  与传统的计算方法相比，不管是在空间复杂度还是在时间复杂度上，所提出的方法都只需付出更小的代价。
• The algorithm proves effective as it need neither static level of detail layers nor huge assistant data structures and is of low space complexity
  该方法不保存静态的细节层次，也没有庞大的辅助数据，空间复杂度低。
• Avs - m1456 , 2004 . 9 joint video team . draft itu - t recommendation and final draft international standard of joint video specification itu - t rec . h . 264 iso iec 14496 - 10 avc
  接着从运算复杂度和空间复杂度的角度分析了此熵编码方法与h . 264中的熵编码cavlc的复杂度比较。
• In this density - based outlier mining algorithm , it takes two divided methods to get k - nearest neighbor , which efficiently reduces time complexity and space complexity
  基于密度的离群点挖掘算法对计算数据的k -最近邻采用二分法，较大减小了时间复杂度和空间复杂度。
• It extracts process information from the proof tree by analyzing every node of resolution proof tree to extract procedure . and the partial correctness of the extracted procedure is proved
  这一方法的特点是，抽取算法的时间、空间复杂度都是线性的，并且抽取算法本身十分简单，易于实现。
• In addition , boundaries can be detected automatically during reconstruction . in order to dispose the large data , we use the divide and conquer method to improve the algorithm mentioned above
  为了能够有效的处理海量数据，我们用分解再合并的思想对上述算法进行了改进，减小了算法的时间复杂度和空间复杂度。
• It can use the reduction ' s middle and last results effectively , so reduce the algorithmic time and space complexity effectively . the validity has been proved by the experimental results we obtained
  该方法通过对属性约简得到的中间结果和最终结果的有效利用，大大降低了算法的时间复杂度和空间复杂度，实验结果也充分证明了该算法的有效性。