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

图标索引 历史查询
 

图构造    
相关语句
  graph construction
    Analysis and Implementation of Sequential Pattern Graph Construction Algorithm
    序列模式图构造算法分析与实现
短句来源
  graph construction
    Analysis and Implementation of Sequential Pattern Graph Construction Algorithm
    序列模式图构造算法分析与实现
短句来源
查询“图构造”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  constructive graph
For the complex problems tested here, it is observed that no feasible solutions can be obtained by the use of pure constructive graph heuristics.
      
  constructive graph
For the complex problems tested here, it is observed that no feasible solutions can be obtained by the use of pure constructive graph heuristics.
      
  graph construction
An autotracing approach to the problem of the algorithm graph construction based on the possibility of overloading operators in the C++ language is suggested.
      
A class graph is responsible for general control of the graph construction process.
      
System dependence graph construction for aspect oriented C++
      
Generic graph construction ideals and Greene's theorem
      
This paper extends the already known techniques for minimizing the stored information for a single substitution of the free constraint variables using transition graph construction.
      
更多          
  graph construction
An autotracing approach to the problem of the algorithm graph construction based on the possibility of overloading operators in the C++ language is suggested.
      
A class graph is responsible for general control of the graph construction process.
      
System dependence graph construction for aspect oriented C++
      
Generic graph construction ideals and Greene's theorem
      
This paper extends the already known techniques for minimizing the stored information for a single substitution of the free constraint variables using transition graph construction.
      
更多          


In 1960, F. Harary and R. Norman extended line graph to diagraph and made researches on Line digraph, so far there are several sufficient and necessary conditions given by some mathematicians successively. For the purpose of unifying the above conditions, the author uses Theorem 2 in this paper to deal with them. In the process of proving Theorem 1, a structural method of root graph is also obtained.

F·Harary和Norman于1960年将线图推广到有向图[1],研究了线有向图。在文[1]及此后其他一些作者的论文中,各自给出了线有向图的充要条件。本文将这些充要条件作了统一处理,有的给出了新的证明,并且在定理1的证明中,给出了一个根图的构造法。

Based on the Tarjan's three lemmas about dominators tree,a new approach to the dominators tree problem is studied in which a directed acyclic graph by DFT is utilized. This method brings forth an efficient computation algorithm.

本文基于Tarjan的三个关于领元树的前进边和跨越边变换的引理,探讨用深度优先搜树(DET)来解决有根无循环方向图的构造问题,得出了领元树计算问题的一个较优算法。

Scattered interpolation plays an important role in practical applications. In this paper, a method to construct a surface with point interpolation and normal interpolation is presented. An algorithm to construct the discrete interpolation is also presented, which has O(Nlog N) time complexity, where N is the number of scattered points.

散乱插值在实际应用中有重要作用.本文通过Voronoi图构造了一张具有点插值和法向插值的曲面.本文的方法优于目前散乱插值中常用的Shepard方法和三角剖分方法.本文还给出了一种求离散插值曲面的算法,算法的时间复杂性为O(Nlog N),N为散乱点数.

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

 


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

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