助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[3]页 共[56]条 当前为第1条到20条
 

相关语句
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.
      
This paper describes a unified and fully automatic algorithm for Reeb graph construction and simplification as well as constriction approximation on triangulated surfaces.
      
We convert the problem of energy function construction into a 3D graph construction, and get the minimal energy by the max-flow theory.
      
Graph construction with the maximum number of trees by continuous edge addition
      
In this paper we evaluate the precision of one specific pointer analysis (the FA pointer analysis by Zhang et al.) for the purposes of call graph construction for C programs with function pointers.
      
To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on the same number of keyframes.
      
Again, the CPU time of graph construction and shortest-path search are measured separately.
      
A more traditional static approach to the dataow graph construction would not allow this.
      
Another, the web front-end, relies on on-demand graph construction through external tools such as dot and GNU graph for its visualization methods.
      
Algorithm based on 2-edge connected graph construction We assume without loss of generality that G is 2-edge connected.
      
As density increases, so does the message overhead, since nodes have more neighbors to consider during graph construction.
      
Because the codes rely on graphs, graph construction must be done in a systematic way such that both ends build the same graph.
      
Dryad supports multiple different data transport mechanisms between computation vertices and explicit dataflow graph construction and refinement.
      
EM3D The EM3D application has a graph construction phase and a computation phase.
      
Graph Construction Under Heterogeneity In this section we study how well the different schemes adapt to heterogeneity.
      
Graph construction is driven by a specific input sequence that serves as the key.
      
 

首页上一页123下一页尾页 

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