助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   运算复杂性 的翻译结果: 查询用时:0.02秒
图标索引 在分类学科中查询
所有学科
电信技术
自动化技术
更多类别查询

图标索引 历史查询
 

运算复杂性
相关语句
  computational complexity
     Since efficient and fast cyclic convolution algorithms are available, the algorithm has low computational complexity, simple and regular structure.
     利用循环卷积和扭循环卷积的高效率和规则的算法 ,构造具有简单、规则的结构和较低的运算复杂性的奇素长度 DCT快速算法。
短句来源
     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外加一些乘法和加法,从而使运算复杂性进一步减少。
短句来源
     This approach applied a processing strategy that from coarse to fine realized region compactibility and overcome the computational complexity of single Gibbs Random Field label structure, decrease computational time, and acquired a better segmentation result.
     算法应用由粗至细的处理策略,实现了图像的区域紧凑性,克服了一层GRF标记场结构的运算复杂性,减少了运算时间,并且能够获得较好的分割结果.
短句来源
     The use of the Walsh-Hadamard Transformation (WHT ) is proposed to improveconvergent performance and to redtice operation for Adaptive Speech echo Canceller(AEC). The arithmetic of this transformation is a simple real arithmetic,This paper compares WHTLMS algorithm(WLMS) with both the time domain and DFT LMS algorithms(TLMS andFLMS)in terns of the convergent performance and computational complexity by theoreticalanalysis and computer simulation.
     为改进自适应语声回波抑制器的收敛性能和减小其运算量,提出了使用较简单而实运算的按阿达玛排列的离散瓦尔什变换(WHT).通过理论分析和计算机模拟,在收敛性能和运算复杂性方面,将WTHLMS算法(WLMS)与时域LMS算法(TLMS)和DFT LMS算法(FLMS)在AEC中的应用进行了比较.
短句来源
     Since efficient and fast cyclic convolution algorithms are available in the literature, the algorithm has low computational complexity, simple and regular structure.
     由于循环卷积和扭循环卷积具有非常高的效率和规则 ,因此 ,本算法具有简单、规则的结构和较低的运算复杂性 .
短句来源
更多       
  calculating complexity
     SSM instead of FFT makes the calculating complexity of OQAM system drop greatly.
     SSM取代FFT,使系统运算复杂性显著下降。
短句来源
     An adaptive algorithm of motion estimation employs the spatial-temproal correlation presented in motion vector field to reduce calculating complexity.
     首先给出一种空-时相关自适应运动估计算法,有效降低运算复杂性
短句来源
  “运算复杂性”译为未确定词的双语例句
     the calculation complexity of algorithm TSA-2 is O(N5), but for HEA it is O(N4-5 log2N), which results in appreciable reduction of calculation time needed.
     而且它的运算复杂性为O(N~(4.5log_2N),从而较之运算复杂性为O(N~5)的算法TSA-2成倍地缩短了编排时间。
短句来源
     The proper algorithm of evaluating FIR filter and DCT provides further reduction of the computation complexity which drops to 35.6 percent of that of Hirosaki's scheme.
     文中给出的FIR滤波和DCT算法与Hirosaki提出的方案相比较,运算复杂性降为35.6%。
短句来源
     By use of the symmetries of coefficients, a special designed fast polynomial transform algorithm and a fast recursive decomposition algorithm for 1D_RDCT are also presented.
     利用算法中系数的特点 ,设计了简化的快速多项式变换算法和 1D_RDCT递归分解算法 ,使运算复杂性进一步降低 .
短句来源
     In addition, compared with the pixel-domain transcoding, the DCT domain transcoding can save the conversion pair of DCT/IDCT, which may decreases operation complexity, thereby, here the method of the DCT domain transcoding is discussed, consists of the algorithms of the DCT domain image down-sampling(mainly aimed at such position that the conversion proportion is relatively simple), DCT domain anti motion compensation and DCT domain motion compensation.
     另外,DCT 域转码比像素域转码节省了DCT/IDCT 变换对,可以降低运算复杂性,因此文中又论述了DCT域转码处理方法,包括DCT 域图像下采样(主要针对变换比例较简单的情况)、DCT域反运动补偿和DCT 域运动补偿算法。
短句来源
     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.
      
更多          
  calculating complexity
We are calculating complexity in a formal way, and with this avoiding the problem with ad-hoc heuristics.
      


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直接变换的计算式及其串行、并行运算的复杂性,其运算量较其他方法要少。

The architecture and operation for the satellite communication system SS-TDMA is described, and the emphasis is on the time slot assignment for an SS-TDMA system. A High-Efficient Time Slot Assignment Algorithm HEA based on the analysis of algorithm TSA-2 is proposed. It decreases the number of modes produced in algorithm TSA-2 by 37.8%; the calculation complexity of algorithm TSA-2 is O(N5), but for HEA it is O(N4-5 log2N), which results in appreciable reduction of calculation time needed.

本文首先简述了SS-TDMA卫星通信系统的组成与工作原理,然后着重对该系统的按需分配时隙编排算法进行了讨论。在分析已有的时隙编排算法的基础上,提出了一个高效的时隙编排算法HEA(High-Efficient Time slot Assignment Algorithm)。它较之算法TSA-2,模式数平均减少了37.8%;而且它的运算复杂性为O(N~(4.5log_2N),从而较之运算复杂性为O(N~5)的算法TSA-2成倍地缩短了编排时间。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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