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

图标索引 历史查询
 

边图
相关语句
  edge graph
    For any weighted graph G=(V,E), it is firstly converted into its general edge graph G′=(V′,E′) through mapping from edges to vertices.
    对于任一赋权图G=(V,E),首先通过边到点映射把它转换为广义边图G′=(V′,E′).
短句来源
  “边图”译为未确定词的双语例句
    Fillet Feature Recognition and Suppression Based on Face-Edge Graph
    基于面边图的圆角特征识别与抑制
短句来源
查询“边图”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  edge graph
Recurrence and transience of the edge graph of a tiling of the euclidean plane
      
The algorithms use characterizations of adjacent vertices in network and dual network LP's to perform an efficient traversal of the edge graph of the polyhedron.
      
Strong isoperimetric inequality for the edge graph of a tiling of the plane
      
We introduce a new kind of graph called "multi-edge graph" which arises in many applications such as finite state Markov chains and broadcasting communication networks.
      
We give two algorithms to partition a multi-edge graph into maximal clusters.
      
更多          


It is a great difficulty of automatic edge match of the adjacent digital maps in capture for GIS. This paper presents a newly-developed method, which can be realized in practice. The method, based on element classification, is accomplished with three steps: extraction of element pairs for map edge match; automatic map edge match based on element pairs classification; map chipping and merging. Moreover, the paper also derives the model for estimation accuracy of edge match in this method. In conclusion, the error...

It is a great difficulty of automatic edge match of the adjacent digital maps in capture for GIS. This paper presents a newly-developed method, which can be realized in practice. The method, based on element classification, is accomplished with three steps: extraction of element pairs for map edge match; automatic map edge match based on element pairs classification; map chipping and merging. Moreover, the paper also derives the model for estimation accuracy of edge match in this method. In conclusion, the error indicator of edge match is 0.3 mm, which can be used for evaluating edge match quality of digital map.

按照地物要素分类接边的方法 ,实现了在数字化地图中相邻图幅的自动接边 .该方法分三步完成接边 :接边要素对的提取 ;接边要素对自动分类接边 ;分幅剪辑 .同时还探讨了该方法产生的接边精度的分析和计算 ,从而得出接边图面精度指标为 0 .3mm的结论 ,这可作为衡量地图数字化质量的一个量化指标

MST problem is a well-known network optimization problem.Efficient solutions based mainly on classical computers,such as Prim algorithm and Kruskal algorithm,are well-known.In this paper,a quantum algorithm for MST is proposed.It combines the method of quantum search with the idea of classical Kruskal algorithm.For an undirect graph with n vertices and m edges,the algorithm searches for n-1edges by turn to construct a MST,the complexity is O(n m√).Making a compare with classical Kruskal algorithm's complexity,its...

MST problem is a well-known network optimization problem.Efficient solutions based mainly on classical computers,such as Prim algorithm and Kruskal algorithm,are well-known.In this paper,a quantum algorithm for MST is proposed.It combines the method of quantum search with the idea of classical Kruskal algorithm.For an undirect graph with n vertices and m edges,the algorithm searches for n-1edges by turn to construct a MST,the complexity is O(n m√).Making a compare with classical Kruskal algorithm's complexity,its speedup is higher than classical one's on an equal footing.

图的最小生成树问题是网络优化中的一类基本问题。目前构造最小生成树的算法都是基于传统计算机的算法如Prim算法和Kruskal算法。该文提出了一个用于构造图的最小生成树的量子算法,它结合量子搜索的方法和经典Kruskal算法的思想,对于n个节点m条边的图,依次搜索出n-1条边使它们构成一棵最小生成树。这一算法的时间复杂性为O(nm√)。与经典Kruskal算法相比,在同等条件下,该文的算法有较快的加速。

In this paper, a model of DNA computing on surface of minimal vertex covering problems of graph is designed a feasible method and operating procedure of biochemical experiment of an example is given. Firstly, we construct a data pool corresponding to the subsets of vertex set of a graph with 6 vertices and 10 edges. Secondly, we proceed a series of biochemical experiments. synthesis, hybridization, cleaning and denaturalization etc. In this way, the DNA sequences corresponding to all the coverings is obtained....

In this paper, a model of DNA computing on surface of minimal vertex covering problems of graph is designed a feasible method and operating procedure of biochemical experiment of an example is given. Firstly, we construct a data pool corresponding to the subsets of vertex set of a graph with 6 vertices and 10 edges. Secondly, we proceed a series of biochemical experiments. synthesis, hybridization, cleaning and denaturalization etc. In this way, the DNA sequences corresponding to all the coverings is obtained. Then, we get all the minimal coverings according to the encoding address procedure.

1994年 ,Adlem an提出一种解决 NP完全问题的新方法— DNA计算 .之后又出现了许多关于 DNA计算的改进操作并增加了其可靠性 ,其中面上操作是一种很有效的方法 .本文利用 DNA计算的固态处理 (面上计算 )解决了图论中又一 NP完全问题—图的最小顶点覆盖问题 .构造了含有 6个顶点 10条边的图的顶点集子集对应的数据池之后 ,进行了一系列的合成、杂交、清洗、变性等生物操作 ,得到所有覆盖对应的 DNA序列 ,然后通过编址过程得到所要求的最小覆盖 .

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

 


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

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