weighted graph的例句大全

In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied.

本文将网格分区问题转化为无向赋权图的分区，在图上研究分区算法。

A motion control algorithm based on the weighted graph is presented, by which the path planning can be completed and the spherical motor can be controlled to achieve the expected trajectory.

同时提出一种基于加权无向图的运动控制算法，通过对路径进行搜索，实现了对电机通电状态的有效控制，达到了沿着期望运动轨迹运动的目的。

discussions about the two algorithms for finding the minimal spanning tree of an undirected weighted graph

求无向赋权图最小生成树的两种算法的探讨

finally, the definition of high connectivity graph was extended to be used in undirected weighted graph, and was taken as termination criteria for graph partitioning.

对高连通图的定义进行引申后，用于无向有权图中，并将高连通图的判据作为图分割的终止判据。

Analysis of Structure and Algorithms of the Gravity Center on a Complete Weighted Graph

完全赋权图重心的结构分析与算法

a weighted bipartite graph is constructed to model the similarity between two shots: every vertex in a bipartite graph represents one frame in a shot, and the weight of every edge represents the similarity value for a pair of frames between two shots.

把两个镜头的相似度度量建模为一个带权的二分图：镜头中的每一帧看成二分图的一个结点，两个镜头之间任意帧的相似值作为边的权值。

Record Cluster Matching Model and Its Algorithm Based on Weighted Bipartite Graph

基于赋权二部图的记录簇匹配模型及其算法

According to the theory of chemical equilibrium and the basic concept of graph theory, a weighted digraph method for chemical equilibrium calculation was proposed.

根据化学平衡原理和图论中的基本概念，提出了一种适用于化学平衡计算的赋权有向图。

The other is weighted bar graph approach which can detect a target in broadband coherent interference and estimate its azimuth angle.

加权直方图方位估计法能从宽带相干干扰中检测目标，估计目标方位。

Large networks attack can be researched base on the graph theory, because the character of its network connect and route of spread is related closely to weighted and oriented graph.

由于大规模网络入侵在网络连接上、传播路径上所体现出来的特性与图论中的赋权有向图有着共同的特性，这使得在图论的基础上进行大规模网络入侵检测的研究成为可能。

This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.

本文对一种目标函数为非线性函数的0&1规划问题提出了一种运用赋权偶图及完美对集的求解方法。

In this paper, a new method for image retrial using color moments of partitions and minimum cost perfect matching for a weighted bipartite graph based on im.

文中利用分块颜色矩，借助带权二部图的最小完美匹配提出了一种新的相似度量方法，既考虑了颜色的空间分布关系，又具有旋转、平移不变性。