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

图标索引 历史查询
 

复杂性算法
相关语句
  complexity measures
     We have applied many complexity measures and theory of statistics to analyzing many speech signal.
     本文运用多种复杂性算法和统计的理论分析了大量的语音信号。
短句来源
  complexity algorithm
     An Automatic License Location and Complexity Algorithm
     复杂性算法在汽车车牌定位中的应用研究
短句来源
     It is proved that K-Tree Term method is a multinomial time complexity algorithm.
     着重证明了K-树组法为多项式时间复杂性算法
短句来源
  “复杂性算法”译为未确定词的双语例句
     Application of complexity method in extending depth of field of image
     复杂性算法在图像景深扩展中的应用研究
短句来源
     The main achievements includes:1) A new fast algorithm for computing prime length DCT using cyclicconvolutions is proposed. The algorithm possesses regular implementationstructure and lower operational complexity compared with existing algorithms. It is suited for both software and hardware implementation.
     取得的主要进展有:1)提出了一种用循环卷积实现的素长度DCT快速新算法,算法具有规则的实现结构,与现有算法相比具有更低的运算复杂性,算法不仅适用于软件实现,而且适用于硬件实现。
短句来源
     WTTA can be used in the status of real time signal processingwithout bringing about the complexity of hardware.
     在实时处理场合WTTA并不增加硬件电路的复杂性,算法具有很大的灵活性。
短句来源
     This paper investigates the optimally algorithm on the task-scheduling problem with deadlines, in which we used the counting sort, the union by rank, and the path compression in the disjoint-set forests, and we gain the new optimally algorithm on the task-scheduling problem with deadlines, the time of the algorithm is O(na(m,n)),m=O(n),the running time is linear for all practical purposes, the asymptotic efficiency of the algorithm is the best.
     本文讨论了有限期作业调度问题,用计数排序、分离森林中的有效路径压缩、按秩合并方法,得到了有限期作业调度最优化算法,其时间复杂性为O(na(m,n)),m=O(n),在实际应用中是一个线性时间复杂性算法,是渐近性能最佳的算法。
短句来源
  相似匹配句对
     AN IMPROVEMENT ON THE DEFINITION OF ALGORITHMIC COMPLEXITY
     算法复杂性定义的改进
短句来源
     The algorithm is an extension of the two-valued cover-most algorithm proposed by M. C.
     该算法是M. C.
短句来源
     This arithmetic is stationary and the time needed is of the order of O(n).
     该算法是稳定的,其时间复杂性为O(n)。
短句来源
     Complexity and post-modernism(Part Ⅰ)
     复杂性和后现代主义(上)
短句来源
     in the algorithm;
     算法简单易行。
短句来源
查询“复杂性算法”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  complexity measures
We also propose a variable weighting technique based on initial problem complexity measures.
      
For the geometric ornaments analytical expressions for entropy and complexity measures are presented, while for the RSA patterns these are calculated numerically.
      
The concept of symbolic dynamics, entropy and complexity measures has been widely utilized for the analysis of measured time series.
      
These findings support the notion thatsome nonlinear methods, such as scaling and complexity measures, give clinically valuable information for riskstratification among various patient populations.
      
In this Letter, we apply the learning properties of two families of Radial Basis Function Networks (RBFN's) to introduce new complexity measures that reflect the learning properties of such neural model.
      
更多          
  complexity algorithm
Now, the lowest time complexity algorithm takes O(logm+logn) time to compute the minimum distance between two disjoint convex polygons P and Q, where n and m are the number of the polygons' edges respectively.
      
We analyze the requirements for a silence detection algorithm hosted on a multimedia communication system, and propose a novel low-complexity algorithm operating in the non-linear domain.
      
We also propose a low-complexity algorithm, in which the centering direction is used whenever an iterate is far from the path of centers.
      
However, members of this class are detected in polynomial time, which leaves the option of switching to a higher complexity algorithm if desired.
      
However, in both cases a linear-time complexity algorithm is provided to decompose into modules.
      
更多          


Whether a given egd is equivalent to a ste of fd's'? A polynomial algorithm is presented to answer this question. The algorithm is also extended to answer the similar question arising for a set of egd's with the same right hand column.

本文将用多项式复杂性算法回答了“一个给定的等值依赖是否等价于某个函数依赖集”的问题,并将这个算法扩充到具有相同右侧属性的等值依赖集的情形.

In this paper, the topological formulation of network sensitivity is derived. A computerprogrom has been compiled and used to find the sensitivity of active network. It is proved that K-Tree Term method is a multinomial time complexity algorithm.

本文导出了网络灵敏度的拓扑公式,编制了计算机程序,并用它求解有源网络的灵敏度。着重证明了K-树组法为多项式时间复杂性算法

In the doctoral disseration of the first author, part of whose research work was done in TU Berlin, one approximate way of dealing with collision detection by fourdimensional intersection testing was studied. We will try to improve the detection efficiency of Cameron′s method (Ref.1) as a part of a research project supported by NNSFC (National Natural Science Foundation of China). In this survey, we compared various possible methods and such survey convinced us that we should pioneer in this research area hitherto...

In the doctoral disseration of the first author, part of whose research work was done in TU Berlin, one approximate way of dealing with collision detection by fourdimensional intersection testing was studied. We will try to improve the detection efficiency of Cameron′s method (Ref.1) as a part of a research project supported by NNSFC (National Natural Science Foundation of China). In this survey, we compared various possible methods and such survey convinced us that we should pioneer in this research area hitherto unexplored in P.R.China. We discussed in some detail the advantages and disadvantages of the following methods for collision detection: (1) fourdimensional CSG method; (2) bintree method; (3) sweeping method; (4) Brep method; (5) octree method, etc. We found that, for our purpose, Cameron′s method is to be preferred chiefly because it is a method that can give the precise time and precise position when collision occurs.

碰撞干涉检测是CAD/CAM和机器人学领域的一个重要方面。本文综述了有关碰撞干涉检测方面的工作,包括各种碰撞检测方法的复杂性、静态和动态检测方法、与时间相关的测试算法,详细讨论了几何与运动方面的复杂性、算法的效率和可靠性,并简要介绍了几种算法。

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

 


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

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