1.
The Research and Application of Association Rules Mining Algorithms Based on Directed Itemset Graph;
基于有向项集图的关联规则挖掘算法研究与应用
2.
Research on Identification of Clusters Based on Directed Graph analysis;
基于有向图分析的集群识别方法研究
3.
Realization of Extended Edge-collection Array Memory Structure of Directed Graph
有向图扩展边集数组存储结构的实现
4.
An Algorithm for Generating Directed Cutsets of Directed Cycling Graph Based on Edge Contracted
基于边被收缩图的有向有环图有向割集求解算法
5.
The Structure and Determination of the Set of Reversible Edges in a Directed Acyclic Graph
有向非循环图的可反向边集合的结构与判定
6.
A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph;
枚举一个无向图所有最小割集的一种简单算法
7.
The Study of Level Sets of Stable Processes and Multifractals of Graph Directed Iterated Function System;
稳定过程的水平集问题和图有向递归集的重分形分析
8.
Maximal frequent item set mining with establishment of frequent item set vectors
建立频繁项目集向量的极大频繁项目集挖掘
9.
a game for two players who try to assemble books of cards by asking the opponent for particular cards.
一种两人玩的纸牌游戏，通过向对手要特殊的牌，力图收集所有的。
10.
Directed Rooted Tree Structure of the Set of Perfect Matchings of Plane Bipartite Graphs and It?s Generation
平面二部图的完美匹配集合上的有向根树结构及其生成
11.
Algorithm for Finding All One-way Sub-graph of Simple Digraph;
简单有向图所有单向分图的求解算法
12.
Collection of fields representing the items in details view.
表示详细信息视图中的项的字段集合。
13.
AutoText entries in Add-in Template:
加载项模板中的“自动图文集”词条:
14.
We shall abbreviate 'directed graph'to digraph.
我们将把“有方向的图”简称为方向图。
15.
Where should the wizard look for the items you collected?
向导应该在哪儿查找您收集的项目?
16.
Mining Maximal Frequent Patterns in a Unidirectional FP-tree;
基于单向FP-树的最大频繁项集挖掘
17.
An Algorithm for Mining Frequent Itemsets in Data Streams
一种面向数据流的频繁项集挖掘算法
18.
A problem occurred when the wizard attempted to rename a registry key.
向导试图重命名注册表项时发生错误。