助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   空间树 的翻译结果: 查询用时:0.03秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

空间树
相关语句
  space tree
     The knapsack problem and 0-1 knapsack problem are introduced,the backtracking algorithm(one of the basic methods of the computer algorithm design) and the concept of state space are described,a backtracking algorithm based on dynamic state space tree which is useful for resolving linear programming is proposed.
     介绍了背包问题及0-1背包问题,阐述了回溯算法(算法设计的基本方法之一)和状态空间的概念,提出一个基于动态状态空间树的回溯算法。
短句来源
     Take 0-1 knapsack problem for example,in contrast to static state space tree algorithm,the new algorithm spends less times and it helps to extend the application of backtracking algorithm.
     以0-1背包问题为例,说明动态树方法对求解线性规划问题等是非常有用的,且该算法所用时间少于静态状态空间树方法,有助于扩大回溯算法的应用。
短句来源
     STATE SPACE TREE METHOD AND EXACT DECOMPOSITION ALGORITHM FOR FINDING NETWORK OVERALLRELIABILITY
     求网络总可靠度的状态空间树法和精确分解算法
短句来源
     Pairwise Test Data Generation Based on Solution Space Tree
     基于解空间树的组合测试数据生成
短句来源
     The concept and Algorithm SSTDKTP of the state space tree T of the directed ? tree polynomial P On, . .
     引入了混合图G的有向K树多项式P(t_(F_1),……F_K)的状态空间树T的概念和算法SSTDKTP。
短句来源
更多       
  spatial orientation tree
     As a famous embedded wavelet zero-tree coding algorithm, SPIHT is easy to realize and modify to suit for SA-DWT based coding than EBCOT algorithm in JPEG2000. This paper proposes to modify the structure and sorting pass of original spatial orientation tree in SPIHT to improve the coding efficiency.
     通过对传统SPIHT空间树结构与排序规则作相应于适形小波变换特点的修改,使其编码效率大为提高。
短句来源
     Second, a fast algorithm based on spatial orientation tree recursive scan for the zerotree coding is designed. The zerotree symbols of one quantization layer can be calculated with only one access per coefficient, solving the rescaning problem completely.
     其次设计了一种基于空间树递归扫描的零树编码快速算法 ,因而完全解决了重复扫描问题 ;
短句来源
  spaces tree
     To check the effectiveness of the system detection logic, model checking strategy enables us to build dynamic spaces tree from initial configuration to terminative configuration which is used to analyze packets of ARP attack.
     为了证明该模型逻辑的有效性,验证策略设计了可以分析ARP攻击数据包从初始组态到终结组态的动态空间树;
短句来源
     Transference of collaborative detection system configurations, dynamic recompose of modules and message parallel transfer mechanism are ratiocinated by calculation of nested spaces tree.
     利用空间树嵌套演算推理协同侦测系统的组态迁移过程,分析模块的动态移动重组以及消息的并行传递机制.
短句来源
  “空间树”译为未确定词的双语例句
     Compression of SAR Image Based on Spatial-Orientation Tree in Wavelet Domain
     基于小波域空间树结构的合成孔径雷达图像压缩
短句来源
     Spatial-Orientation Tree (SOT) in wavelet domain and image compression algorithms based on SOT include EZW and SPIHT are studied.
     详细研究了小波域空间树结构SOT,以及基于SOT的EZW嵌入式编码算法和SPIHT算法,仿真了EZW算法。
短句来源
     The generative mechanism and conventional reduction methods of speckle noise, soft threshold and hard threshold methods in wavelet domain are investigated. 4) A SOT structure based method for SAR image compression is proposed, which integrated speckle noise removal and EZW algorithm.
     (4)提出一种新的SAR图像压缩方法,该方法结合了基于小波域空间树结构SOT的相干斑噪声抑制和EZW嵌入式零树编码算法,充分利用了SOT这个作为研究不同分辨率小波系数的空间相互关系的非常有效的数据结构。
短句来源
     Results of compression of large numbers of Airborne SAR images validate the proposed method is efficient and better than JPEG and EZW algorithm, which reduced the infection of speckle noise and improved compressibility of SAR image.
     在计算机上对机载合成孔径雷达图像进行压缩仿真实验的结果显示,本文算法优于JPEG和标准E刃胃算法,降低了相干斑噪声对SAR图像的影响,提高了压缩性能,是一种有效的SAR图像压缩算法。 关键词:合成孔径雷达图像压缩小波变换空间树结构EZW算法相干斑抑制/f了
短句来源
     The method uses one state spacetree to describe thesolution space of the problem.
     经改进的算法仅用一棵状态空间树描述问题的解空间。
短句来源
更多       
查询“空间树”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  space tree
State space tree method and exact decomposition algorithm for finding network overall reliability
      
First, the state space tree method for finding communication network overall reliability is presented.
      
This paper establishes an upper bound on the time complexity of iterative-deepening-A* (IDA*) in terms of the number of states that are surely-expanded by A* during a state space tree search.
      
The conditions that give rise to the worst case performance of IDA* on any state space tree are described.
      
We have surveyed 3,000 streets and parks in the city, noting the species, number, and condition of every public space tree.
      
更多          
  spatial orientation tree
A tree structure, called spatial orientation tree, naturally defines the spatial relationship on the hierarchical pyramid.
      
Below, we will subsequently describe how the concepts of a spatial orientation tree and successive refinement can be used for color image compression.
      
This can be attributed to its set partitioning sorting-refinement process more than its spatial orientation tree.
      
The sorting pass selects the significant coefficients and encodes the spatial orientation tree structure.
      
The spatial orientation tree is chosen to represent the transformed image.
      


The concept and Algorithm SSTDKTP of the state space tree T of the directed ?tree polynomial P On, ....., FK) of a composite graph G are introduced. Then a new algorithm- Algorithm DKTPCG is presented for the direct generation of P(tF1, FK) using branch-and-bound method. The algorithm is simple, and the resulting expression is very com pact. The computing time complexity is O(men1). The space complexity is O[(n-k)(ke+ n)] for stacks and O(ndf) for output arrays XE, YE, FL and NS, where n, and ndf, are the numbers...

The concept and Algorithm SSTDKTP of the state space tree T of the directed ?tree polynomial P On, ....., FK) of a composite graph G are introduced. Then a new algorithm- Algorithm DKTPCG is presented for the direct generation of P(tF1, FK) using branch-and-bound method. The algorithm is simple, and the resulting expression is very com pact. The computing time complexity is O(men1). The space complexity is O[(n-k)(ke+ n)] for stacks and O(ndf) for output arrays XE, YE, FL and NS, where n, and ndf, are the numbers of leaf and state nodes of T, respectively.

引入了混合图G的有向K树多项式P(t_(F_1),……F_K)的状态空间树T的概念和算法SSTDKTP。提出了用分支-定界法产生P(t_(F_1),……,F_K)的一个新算法——算法DKTPCG。该算法简单,所得表达式十分紧凑。计算时间复杂度是O(men_l);空间复杂度对于堆栈是O[(n-k)(ke+n)],对于输出数组XE,YE,FL和NS是O(n_(df)),这里n_l和n_(df)分别是T的叶点和状态节点的数目。

The state space tree method for finding communication network overall reliability is presented. It directly generates one disjoint tree multilevel polynomial of a network graph. Its advantages are small computational effort and short resulting expression. Based on the state space tree method, an exact decomposition algorithm for finding communication network overall reliability is presented by applying the hypergraph theory. If the m-time decomposition of a network graph is carried out by the algorithm, then...

The state space tree method for finding communication network overall reliability is presented. It directly generates one disjoint tree multilevel polynomial of a network graph. Its advantages are small computational effort and short resulting expression. Based on the state space tree method, an exact decomposition algorithm for finding communication network overall reliability is presented by applying the hypergraph theory. If the m-time decomposition of a network graph is carried out by the algorithm, then the communication network scale which can be analyzed by a computer can be extended to m-fold.

本文提出了求通信网络总可靠度的状态空间树法。它直接产生网络图的一个不交化树多层多项式,优点是计算量较小[计算时间复杂度为0(?),(?)为边数,n_1为叶数],所得表达式较短。在此基础上应用超图理论提出了求通信网络总可靠度的精确分解算法。用它进行网络图的m次分解,一台计算机所能计算的通信网络规模可以扩大m倍。

A new algorithm SSTMSD for finding symbolic determinants-----state space tree method for determinants is presented by applying LIFO branch-and-bound search technique and the concept of state space tree (it is the development and improvement of Minty algorithm) . Based on it and by applying the concept of modified graphs, a new algorithm SSTMSF for finding symbolic system functions-state space tree method for system functions is proposed. As compared with the current conventional methods (e. g. signal flow graph...

A new algorithm SSTMSD for finding symbolic determinants-----state space tree method for determinants is presented by applying LIFO branch-and-bound search technique and the concept of state space tree (it is the development and improvement of Minty algorithm) . Based on it and by applying the concept of modified graphs, a new algorithm SSTMSF for finding symbolic system functions-state space tree method for system functions is proposed. As compared with the current conventional methods (e. g. signal flow graph method and directed tree method, etc.) , SSTMSF has the following two advantages: (1) Its computing efficiency is higher and its resulted expressions are shorter. (2) The denominator (determinant) and numerator (cofactor) of a symbolic system function can be separately found by repeatedly call the same one procedure SSTMSD.]

应用LIFO分支-定界搜索法和状态空间树概念,提出了求符号行列式的新算法SSTMSD——行列式的状态空间树法(它是Minty算法的发展和改进);根据它并应用变形图概念提出了求符号系统函数的新算珐SSTMSF——系联函数的状态空间树法。

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

 


 
CNKI小工具
在英文学术搜索中查有关空间树的内容
在知识搜索中查有关空间树的内容
在数字搜索中查有关空间树的内容
在概念知识元中查有关空间树的内容
在学术趋势中查有关空间树的内容
 
 

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