全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 运算复杂性 在 数学 分类中 的翻译结果: 查询用时：0.843秒
 历史查询

 运算复杂性 computational complexity(1)
 computational complexity
 It is shown that, the N×N point 2D DFT is decomposed as one((N/2)×(N/2))point radix-2 2D DFT and twelve((N/4)×N/4)) point radix-4 2D DFT with the addition of some complex multiplications and complex additions, therefore, the computational complexity of the new algorithm is further reduced Finally, the signal flow graph is given 它将(N×N)点2DDFT分解为一个(N/2)×(N/2)点基22DDFT和十二个(N/4)×(N/4)点基42DDFT外加一些乘法和加法,从而使运算复杂性进一步减少。 短句来源
 “运算复杂性”译为未确定词的双语例句
 The new algorithms can preserve the characteristic of Toeplitz matrix after transform, the arithmetic operations required by the new algorithms are reduced greatly compared with that of classical trigonometric thransform. 由于小波的紧支撑特性,Toeplitz矩阵变换后保持原有结构,与Toeplitz矩阵现有三角变换算法相比,其运算复杂性大为减少. 短句来源 For giving the simple solution to the fuzzy initial value problem of fuzzy differential equation and avoiding the operational complexity by using a[0,1] in the expression theorem of fuzzy set theory. This paper solves the fuzzy initial value problem by using the method of fuzzy structure element and gives the general solution formula of fuzzy initial value problem. 为了给出微分方程的模糊初值问题更加简便的求解方法,避免表现定理中a遍历[0,1]造成的运算复杂性,采用模糊结构元的方法来求解线性微分方程的模糊初值问题,给出了模糊初值问题解的通解公式。 短句来源

我想查看译文中含有：的双语例句

 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. 更多
 Let be a Fu33y binary relation on a set consisting of n elements. In theprocess of calculating the transitive closure of with the expression =U~2U...U, the number of operations will be 2n~3(n-1). This paper offers another algo-rithm which decreases the number of operations to 2n~3. Besides, an example of F_(u33y)conditional proposition implications is concerned. 设?是包含n个元的集上的Fu33y二元关系。如果根据等式?=?U~2U…U?~n计算传递闭包?,那么运算的复杂性是O(n~4)。本文提出一种算法,运算量减少为2n~3,并举了一个应用的例子。 In this paper, we directly set up an N-dimensional transiormn matrix for a kind of general N-dimensional orthogonal transformation which is widely used.The calculation for the transformation by this matrix is obviously less than that by the usually used methods. As for application, we give the formulae and the complexity of the sequential and parallel algorithms for the general N-dimensional direct transformation of FFT, as well as the quantity of its calculation. 本文对常见的一般多维正交变换直接导出了一个变换矩阵,利用这个变换矩阵进行变换的计算量低于通常所采用方法的计算量。作为应用,本文给出了一般多维FFT直接变换的计算式及其串行、并行运算的复杂性,其运算量较其他方法要少。 Recenty, the split-radix FFT algorithm has been extended to 2D vector-radix FFT. In this paper, A new algorithm of the 2D split vector-radix FFT is derived. It is shown that, the N×N point 2D DFT is decomposed as one((N/2)×(N/2))point radix-2 2D DFT and twelve((N/4)×N/4)) point radix-4 2D DFT with the addition of some complex multiplications and complex additions, therefore, the computational complexity of the new algorithm is further reduced Finally, the signal flow graph is given 近来,分离基FFT算法已推广到二维矢量基FFT。本文提出一种分离矢量基2DFFT新算法。它将(N×N)点2DDFT分解为一个(N/2)×(N/2)点基22DDFT和十二个(N/4)×(N/4)点基42DDFT外加一些乘法和加法,从而使运算复杂性进一步减少。 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关运算复杂性的内容 在知识搜索中查有关运算复杂性的内容 在数字搜索中查有关运算复杂性的内容 在概念知识元中查有关运算复杂性的内容 在学术趋势中查有关运算复杂性的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社