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

图标索引 历史查询
 

graph partitioning problem
相关语句
  图划分问题
    Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths.
    用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题
短句来源
    Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.
    计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。
短句来源
    Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.
    设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。
短句来源
  “graph partitioning problem”译为未确定词的双语例句
    Shi and Malik converted image segmentation into graph partitioning problem and proposed the normalized cut criterion. Rather than focusing on local features and their consistencies in the image data, this approach aims at extracting the global impression of an image.
    Shi和Malik将图像分割转化为图的划分问题,提出了归一化割准则,这种分割方法没有把局部特征和一致性度量作为解决问题的关键,而是着重于提取整幅图像的特征,因此取得了较好的分割结果。
查询“graph partitioning problem”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph partitioning problem
This paper describes an empirical study of the performance of various local search heuristics for thisk-way graph partitioning problem.
      
The graph partitioning problem consists of dividing the vertices of a graph into clusters, such that the weight of the edges crossing between clusters is minimized.
      
When the NP hard graph partitioning problem is formulated as a continuous quadratic programming problem, the constraints have this structure.
      
In the graph partitioning problem, as in other NP-hard problems, the problem of proving the existence of a cut of given size is easy and can be accomplished by exhibiting a solution with the correct value.
      
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each consisting of no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
      
更多          


Machine redundant manufacturing cell design is the complex combination optimal problem that has various constraints,Graph partition algorithm can't solve this problem,because the number of graphs that need to be partitioned is exponential.Proposed half edge graph theory,half edge belongs to vertex,a couple of half edges could assemble one edge.Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way...

Machine redundant manufacturing cell design is the complex combination optimal problem that has various constraints,Graph partition algorithm can't solve this problem,because the number of graphs that need to be partitioned is exponential.Proposed half edge graph theory,half edge belongs to vertex,a couple of half edges could assemble one edge.Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths.

机器可选制造单元设计问题是一类含有多种局部约束的复杂组合优化问题,用图划分算法解决此类问题将会面临指数级个图的划分。论文提出半边图理论,半边附属于顶点,一对半边可结合为边。用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题。

Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20×20 example,on 12.4 average times extrude and intake can get the optimizm solution....

Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20×20 example,on 12.4 average times extrude and intake can get the optimizm solution.

计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。示例表明,半边图语言能够准确地表达可能解中的复杂结构和各种约束。20台机器20种零件分组实验证明,平均12.4次迭代计算即可达到优化目标。

>=Medical image segmentation is an important medical image processing technology and its accuracy directly influences the validity of following processing. Many algorithms are proposed for image segmentation, including the method based on graph theory. Shi and Malik converted image segmentation into graph partitioning problem and proposed the normalized cut criterion. Rather than focusing on local features and their consistencies in the image data, this approach aims at extracting the global impression...

>=Medical image segmentation is an important medical image processing technology and its accuracy directly influences the validity of following processing. Many algorithms are proposed for image segmentation, including the method based on graph theory. Shi and Malik converted image segmentation into graph partitioning problem and proposed the normalized cut criterion. Rather than focusing on local features and their consistencies in the image data, this approach aims at extracting the global impression of an image. The normalized cut criterion measures the total dissimilarity between the different groups as well as the total similarity within the groups. The algorithm and how to apply it to segmenting medical images are introduced in this paper. Valuable experimental results are obtained.

医学图像分割是一种重要的医学图像处理技术,它的准确性直接影响后续处理的有效性,因此具有十分重要的意义。目前,许多算法被应用于图像分割问题,基于图论的图像分割方法就是其中之一。Shi和Malik将图像分割转化为图的划分问题,提出了归一化割准则,这种分割方法没有把局部特征和一致性度量作为解决问题的关键,而是着重于提取整幅图像的特征,因此取得了较好的分割结果。归一化割准则不仅度量了不同分组之间的总体不相似性,同时度量了各个组之内的总体相似性。本文具体研究了该算法,并将它应用于医学图像分割中,取得了较好的结果。

 
图标索引 相关查询

 


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

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