查询词典 labeled graph

Labeled and unlabeled examples are represented as the nodes, and their distances as the weights of edges in the graph.

在这个图模型中，各个有标签和未标签的样本被表示成图上的各个节点，而样本间的距离则作为图上各边的权重。

The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph.

任务集是通过一个有向无环图来定义的，每个任务就是图中的一个节点。

As the graph of Bayesian network is required to be a directed acyclic graph, which was changed during the constructing process, checking for cycle is need in the interaction.

由于贝叶斯网的网络结构要求为一有向无环图，并且此图在交互建网过程中时刻变化，所以要在交互过程中反复检测环路是否存在。

The commit objects form a directed acyclic graph, because they have parents, and the graph of commit objects is acyclic (there is no chain which begins and ends with the same object).

交付对象是按一个单向非环路是图的形式来组织的，因为他们有父辈，以及非环路视图（不存在开始和结尾都是同一个对象的情况）。

The spectral graph theory is one of the main branches in algebraic graph theory, it is mainly concerned with the adjacency spectrum and the Laplacian spectrum.

图的谱理论是代数图论中的一个重要课题，主要涉及图的邻接谱与图的Laplacian谱的研究。

The study of graph spectra is an important direction of research in algebraic graph theory, and its main object of study is the adjacency spectrum and the Laplacian spectrum.

对图谱的研究是代数图论中的一个重要研究方向，其主要研究对象是图的邻接谱与图的Laplacian谱。

In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.

在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数：对图G，设Q_u={|u"∈N}∪{|u∈N}，σ：I→C为图G的k-关联着色，C_u表示着在Q_u上的色集。

The study of molecular topological indices and the invariants of molecular graph is one of the most active area in the modern chemical graph theory.

分子拓扑指数以及分子图的不变量的研究是现代化学图论中最活跃的研究领域之一。

On this foundation, the paper proposes distinguishing the shape of the graph by using the graph area and the perimeter ratio scope.

在此基础上提出了利用图形的面积和周长的比值范围来识别出图形的形状。

The paper proposes distinguishing the shape of the graph by using the graph area and the perimeter ratio scope.

在此基础上提出了利用图形的面积和周长的比值范围来识别出图形的形状。

We got alerted a couple of times while we were down south that HETs were on the way to bring us back up north because things were going to go hot again, but it was just rumors.

南下的途中我们不只一次得到警告说重型装备运输车将拉着我们重新北上，因为局势正在变得重新紧张起来，但这只是谣传。

It's the one where they find the ghost in the salt mine.

这一集是演他们在盐矿找到鬼