结构化活动结点的子图支持
子图D'的权为最小。
提出了一种基于关联矩阵的频繁子图挖掘算法。
An algorithm for mining frequent subgraphs based on associated matrix was proposed.
图的直系子图是由返回的子模型对象列表确定的。
The diagram's immediate children are determined by the list of child model objects returned.
若图G含有生成欧拉子图，则称G是超欧拉的。
A graph G is supereulerian if G has a spanning eulerian subgraph.
通常这个发生的原因是子图涉及到相关的一套功能。
Usually this occurs because a subgraph concerns a related set of functionality.
其原理是用设计好的模块对分块子图象作最佳逼近。
The principle is approaching image block with pattern block designed.
频繁子图挖掘主要涉及到子图搜索和子图同构问题。
Frequent subgraph mining includes subgraph search and isomorphism problems.
研究了森林图的子图：邻接森林图和叶交换森林图。
The subgraphs of a forest graph, such as adjacent forest graphs and leaf exchange forest graphs, are studied.
做工精致细腻的红色床帘和喜被上面刺绣的都是百子图。
The delicate and exquisitely embroidered bed curtain and quilt both feature a hundred playing children.
在芯片扫描图的信息处理中采用了子图分割和单独处理方式。
In treating with a chip scan picture, adopt sub-picture segmentation and separateness disposal mode.
并采用帧间差值的统计指标，来衡量模板与目标子图的相似性。
After that take even gray difference to evaluate the similarity of target sub-zones and adjustable templates.
提出了基于二维直方图分析的二元子图微光图像增强处理算法。
A novel image enhancement technique suitable for low light level image, dualistic sub image enhancement based on two dimensional histogram analysis and histogram equalization, is presented.
中文摘要在本篇论文中我们提出探勘具时间限制的频繁子图问题。
In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.
实现此目的最简便方法之一就是创建一个子图，并将图像和标签放在子图中。
One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.
内容的图形不是很有趣，并且它通常只是一个空面板，该面板将包含图的子图。
The content's figure is not too interesting, and is often just an empty panel that will contain the diagram's children.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.
清单4中的行1定义了名为 cluster_jhuapl.edu 的子图。
Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.
随着图的广泛应用，图的规模不断扩大，因此提高频繁子图挖掘效率势在必行。
Therefore it is imperative to improve the efficiency of mining the frequent subgraphs.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
该算法首先搜索得到与所有查询关键字相关的中心节点，再通过中心节点搜索连接成子图。
This algorithm firstly searches for the central node of the query keywords, and then searches for the keyword nodes through this central node to construct the subgraph.
对人脸图象作正交小波变换，得到它在不同频带上的四个子图象，然后分别提取奇异值特征。
We do orthogonal wavelet transform of a face image, get its four sub images of different frequency bands, then respectively extract their singular value features.
虽然也有不少研究关注网络编码应用中的优化问题，但都侧重于求解最小代价多播子图问题。
Although a few researches have discussed the optimization problem under network coding scenario, their aim is to seek minimum-cost multicast sub-graph.
最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.
该文简要介绍图的连通子图、图的最大团、图的完美匹配及图谱法在蛋白质结构预测中的应用。
The paper briefly introduces some graph theory methods such as maximal connected subgraph, maximal cliques, perfect match and graph spectral research which applied in prediction of protein structure.
一个图G中所含的三结点连通导出子图的个数记为S_3（G），它在网络可靠性中起着重要作用。
The number of 3-nodes connected induced subgraphs S3(G) in a graph G plays a important role in the reliability of a network.
鉴于这种情况，将最大拓扑公共子图法与编辑距离测量法相结合，提出了一种新的相似性测量方法。
In this new similarity measure, main structure of the graph is first measured according to the topological common subgraph.
则节点移除后网络的破坏程度可以用最大连通子图的相对大小，全局效率以及脆弱性指标来进行评价。
Using a vulnerability index and reviewing risks from deliberate and random attack the effectiveness of the sorting methods is then evaluated.
一种解决的方法就是用图的形式表示这些领域的事务，然后利用基于图论的数据挖掘技术发现频繁子图。
An alternate way to solve these problems is to represent the transactions of those domains by graph, and find the frequent subgraphs by using graph-based data mining techniques.
一种解决的方法就是用图的形式表示这些领域的事务，然后利用基于图论的数据挖掘技术发现频繁子图。
An alternate way to solve these problems is to represent the transactions of those domains by graph, and find the frequent subgraphs by using graph-based data mining techniques.
应用推荐