• Line 1 of Listing 4 defines a subgraph called cluster_jhuapl.edu.

    清单4中的1定义了名为 cluster_jhuapl.edu 的子图。

    youdao

  • A graph G is supereulerian if G has a spanning eulerian subgraph.

    G含有生成欧拉子图,则称G欧拉的。

    youdao

  • Frequent subgraph mining includes subgraph search and isomorphism problems.

    频繁挖掘主要涉及到子图搜索图同构问题

    youdao

  • Usually this occurs because a subgraph concerns a related set of functionality.

    通常这个发生原因子图涉及到相关功能

    youdao

  • Then, the algorithm is extended to process subgraph queries in form of bipartite graphs.

    然后算法扩展处理特殊二分查询

    youdao

  • In this paper we introduce a problem of discovering frequent subgraph with flexible time constraints.

    中文摘要本篇论文我们提出探勘时间限制频繁子图问题

    youdao

  • One of the easiest ways to do this is to create a subgraph and place both the image and the label inside the subgraph.

    实现目的简便方法之一就是创建个子图,图像标签放在子图中。

    youdao

  • In this new similarity measure, main structure of the graph is first measured according to the topological common subgraph.

    鉴于这种情况,将最大拓扑公共子法与编辑距离测量法相结合,提出一种新的相似性测量方法。

    youdao

  • A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.

    最优化理论中的一个有名问题要求:用比较容易方法寻求具有某种特殊性质的生成图。

    youdao

  • The paper studies circuit design subgraph search algorithm and puts forward a new search algorithm that bases on circuit character.

    本文研究分析了电路设计搜索算法的设计思路,提出一种新的基于电路特征分析的电路设计子图搜索算法。

    youdao

  • The maximum clique problem (MCP) is a classical graph-theoretic problem, which aims to find the maximum complete subgraph of a given graph G.

    最大问题一个经典图论问题,目标是找出给定的某个最大完全子图

    youdao

  • This system adopts open subgraph bank and the drawing, data management, analysis and calculation can be all completed on same operating platform.

    系统采用开放式子图库,使绘图数据管理分析计算同一操作平台下完成

    youdao

  • It only remains to replace each edge of this diagram by a suitable subgraph which bears the information previously given by the direction and colour.

    剩下要做只是适当代替这个图解条边,使得原来方向颜色给出信息这个子图来担当

    youdao

  • First of all, original image is divided into blocks, each subgraph for integer wavelet decomposition, and then the binary image after scrambling embedding.

    首先原始图像进行分块,逐一对每块子图进行整数小波分解然后置乱二值图像嵌入到低频系数。

    youdao

  • With the increasing demand of massive structured data analysis, mining frequent subgraph patterns from graph datasets has been an attention-deserving field.

    随着大量结构化数据分析需求增长集合中挖掘频繁子图模式已经成为数据挖掘领域的研究热点。

    youdao

  • 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.

    g匹配可扩如果G中导出子图是偶的匹配m可以扩充为g的完美匹配。

    youdao

  • On the basis of molecular subgraph coding method, a back propagation neural network was trained on the molecular subgraph code to predict Gibbs energy of alkanes.

    采用分子编码法烷烃分子子图作为人工神经网络输入参数 ,对烷烃布斯自由能进行预测

    youdao

  • 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.

    算法首先搜索得到与所有查询关键字相关中心节点通过中心节点搜索连接子图。

    youdao

  • In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.

    证明个无可分离三角形几乎三角剖分均存在一个2-连通支撑子图,其大度至多3.并且,一结果最佳可能的。

    youdao

  • The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.

    算法利用二进制分割无向顶点通过对子图各顶点关联的运算产生相应的集。

    youdao

  • This algorithm firstly searches for the matching keyword nodes of the query keywords, and then Bridges these keyword nodes through the central node of them to construct the subgraph.

    算法首先搜索得到与查询关键字匹配关键字节这些关键字节点中心节点它们连接成子图。

    youdao

  • In the paper, we prove that the edge number of the Subgraph with maximal edge number of cube graph is equal to the number of 1 in (0,1)-string all integers between 1 and its verter number.

    本文我们证明立方极大子图边数等于1的点数之间所有正整数的(0,1)——串表示中1的个数

    youdao

  • We consider three types of probability measures on Q, the set of subgraphs of g, which govern a random spanning tree, a random spanning forest, and a random connected subgraph respectively.

    本文研究g子图空间g的三类概率测度它们分别刻画图的随机扩张,随机扩张森林随机连通子图。

    youdao

  • 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.

    该文简要介绍连通图、图的最大、图的完美匹配图谱蛋白质结构预测中的应用

    youdao

  • This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism, and also proposes a novel method to extract subword parallelism based on the cost subgraph.

    本文说明传统并行技术可以有效地开发循环中的子字并行性,同时提出基于代价子图的子字并行指令自动识别的方法

    youdao

  • This paper shows that the traditional parallelization techniques can be used to exploit subword parallelism, and also proposes a novel method to extract subword parallelism based on the cost subgraph.

    本文说明传统并行技术可以有效地开发循环中的子字并行性,同时提出基于代价子图的子字并行指令自动识别的方法

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定