助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   计算复杂性 的翻译结果: 查询用时:0.061秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
电信技术
自动化技术
工业通用技术及设备
航空航天科学与工程
互联网技术
宏观经济管理与可持续发展
核科学技术
更多类别查询

图标索引 历史查询
 

计算复杂性     
相关语句
  computational complexity
     Study of Computational Complexity for F′2|m_1=1, m_2=2|C_(max) Scheduling Problems
     F′2|m_1=1,m_2=2|C_(max)排序问题的计算复杂性研究
短句来源
     The computational complexity is O(kn2).
     计算复杂性为O(kn~2)。
短句来源
     The Computational Complexity for a Type of the Second Class Fredholm Integral Equations
     一个第二类Fredholm积分方程类的计算复杂性
短句来源
     The Computational Complexity of Packing Problems
     Packing问题的计算复杂性
短句来源
     Based on the new fastalgorithm for DCT,the new fast recursive algorithm for DFT hasthe same computational complexity as FFCT and SR-FFT but abetter recursive structure.
     基于DCT的快速新算法,DFT的递归快速新算法具有和FFCT和SR—FFT同样的计算复杂性,但具有更好的递归结构。
短句来源
更多       
  computing complexity
     The computing complexity of this algorithm is O(M(m~3+mn)).
     该算法的计算复杂性为O(M(m3+mn)).
短句来源
     The lifting coefficients of SWE13/7 are all simple fractions,so wavelets transform only with integer shift and adder operations can be obtained in computing process,the computing complexity is efficiently lower than D9/7,and the result is equivalent to those using floating number in computing process.
     SWE13/7的提升系数是简单分数,从而可以得到在计算过程中仅使用到整数位移和加法的提升格式,使计算复杂性大幅度低于D9/7小波,而且结果等价于中间过程使用浮点数运算时的结果。
短句来源
     the other is represented by Zuker algorithm whose computing complexity is O(n3).
     一类是以Zuker算法为代表,计算复杂性为O(n~3)。
短句来源
     Second, to speed up the determination of stem criticality and to increase new critical paths as more as possible without adding the computing complexity, several effective methods are presented.
     第二,对扇出源的临界性确定,在尽量不增加计算复杂性的前提下,以尽可能使电路中有更多、更长的新的临界路径为原则,提出了加速扇出源临界性确定的有效方法。
短句来源
     This paper also present a recursive formula and a polynomial-time algorithm for the computing of differential probabilities for addition modulo 2~n with multiple inputs, which cut down the computing complexity of the computing XOR differential probabilities for addition modulo 2~n with m inputs from O(2~(mn)) to O(m~5n).
     给出了差分转移概率的递推计算公式,据此给出了计算差分转移概率的一个多项式时间的算法,从而将计算m变元模2~n加的差分转移概率的计算复杂性从O(2~(mn))降为O(m~5n)。
短句来源
更多       
  computation complexity
     Therefore, blind synchronization of received DS-SS/BPSK signal at lower SNR (<-17dB) can achieve efficiently at cost of a certain computation complexity.
     在一定的计算复杂性条件下,该方法可有效实现负信噪比(SNR<-17dB)DS-SS/BPSK信号盲粗同步,为快速进行精确同步奠定了基础。
短句来源
     For an N×N image and M×M template (K=N, Mcomputation complexity of the algorithm of restricted local register are all O(M 2). Obviously,the parallel algorithm is an optimal speed-up algorithm.
     该算法对于 N× N的图像和 M× N的模板 ,其通信复杂性和计算复杂性都是 O( M2 ) ,分析表明该算法是最优的 .
短句来源
     Because HECC's encrypted strength is very high, and computation complexity is very great, therefore, to realize the HECC will have great theory significances and application values for enhancing the information systems security and researching the more powerful cryptography.
     因为HECC的加密强度很高、计算复杂性也很大,所以实现HECC,对于增强信息系统的安全性和研究更高强度的加密系统都有着重要的理论意义和较高的使用价值。
短句来源
     Current Situation and Prospect of Computation Complexity Theory
     计算复杂性理论的近况与展望
短句来源
     The optimization of EC is taken as a combination optimization problem, in this thesis, which is investigated from model analysis, algorithm design, and its application on the basement of computation complexity theory.
     己提出的紧急控制优化模型,为充分借鉴现有优化领域的进展,研究、开发有效的紧急控制优化算法创造了条件。 本文从模型分析、算法设计、应用的角度,依据计算复杂性理论对此做了初步的探讨。
短句来源
更多       
  computation time complexity
     The Fast Algorithms and Computation Time Complexity of Level-2 (r_1,r_2)-Circulant Matrices of Type(2~(k_1),2~(k_2))
     关于(2~(k_1),2~(k_2))型二重(r_1,r_2)-循环矩阵的快速算法和计算复杂性
短句来源
     In this paper,we give a fast algorithm for evaluating inverse matrices of level-k(r 1,r 2,…,r k-circulant matrices of type(n 1,n 2,…,n k),its computation time complexity is O[(∏ki=1n i)log 2∏ki=1n i].
     本文给出了 (n1 ,n2 ,… ,nk)型k重 (r1 ,r2 ,… ,rk) 循环矩阵求逆的快速算法 ,其计算复杂性为O[( ∏ki=1ni)log2 ∏ki=1ni]。
短句来源
     THE LEVEL-2(r_1,r_2)-CIRCULANT MATRICES OF TYPE (n_1,n_2) AND THE COMPUTATION TIME COMPLEXITY OF SOME RELATED ALGORITHMS
     (n_1,n_2)型二重(r_1,r_2)——循环矩阵及有关算法的计算复杂性
短句来源
     By the Fast Fourier Transform(FFT),this paper present a fast algorithm for multiplication of level-k(r1,r2,...,rk)-circulant matrices of type(n1,n2,...,nk) of order n,their computation time complexity are O(nlog2n),where n=ni.
     利用快速富里叶变换(FFT),给出n阶(n1,n2,…,nk)型k重(r1,r2,…,rk)-循环矩阵相乘的快速算法,其计算复杂性为O(nlog2n),其中n=k
短句来源
     The computation time complexity of the algorithm is O(log_2n)by using FFT.
     若用FFT计算,其计算复杂性为O(log2n)。
短句来源
更多       

 

查询“计算复杂性”译词为其他词的双语例句

 

查询“计算复杂性”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  computational complexity
Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two.
      
Computational complexity of (2,2) path chromatic number problem
      
The algorithm exhibits either a solution or its nonexistence after at most, steps (where n is the dimension of the problem) and the computational complexity is at most1/3n3 + O(n2)
      
This paper studies the computational complexity of this problem for graphs with small diameters.
      
However, its computational complexity was comparable to that of the normalized least-mean-square (NLMS) algorithm.
      
更多          
  computing complexity
This algorithm is provided with a sound theoretic basis, and its computing complexity is relatively lower and not strongly dependent on the data length.
      
However, some redundant and irrelevant attributes, which result in low performance and high computing complexity, are included in the very large database in general.
      
This attack solves the tradeoff between the length of the keystream and the computing complexity needed to recover the secret key.
      
This algorithm produces rational, robust results while reducing computing complexity.
      
However, the computing complexity of the second stage is higher than that of the first stage, thus the three-stage algorithm is a preferred choice unless the frequency uncertainty is small.
      
更多          
  computation complexity
The steepest decent method features fast convergence at the initial iteration and small computation complexity.
      
The proposed algorithm can greatly reduce the state number, thus leads to the computation complexity reduction.
      
This method can reduce the computation complexity and pick up the vector coding process.
      
In comparison with schemes based on channel estimation, our algorithm need not explicitly estimate the space-frequency channel for each active user, so it has lower computation complexity.
      
Compared with the conventional M-ary MC-CDMA receiver, the proposed scheme increases bandwidth efficiency, meanwhile, it achieves M-ary despread spectrum and multi-carrier demodulation, which reduces computation complexity remarkably.
      
更多          
  computation time complexity
After justifying the convergence of the Discrete Legendre Transform to the Legendre-Fenchel transform, an extended computation time complexity analysis is given and confirmed by numerical tests.
      
Its worst case computation time complexity is the same as that of the Dijkstra algorithm, i.e., O(?V?2), where ?V? is the number of nodes in the network.
      
Also, Table 1 shows the computation time complexity of the above mentioned techniques.
      
  其他


点击这里查询相关文摘
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关计算复杂性的内容
在知识搜索中查有关计算复杂性的内容
在数字搜索中查有关计算复杂性的内容
在概念知识元中查有关计算复杂性的内容
在学术趋势中查有关计算复杂性的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社