查询词典 figurative graph

The graph cliping algorithm is the basis of computer graphics algorithms.The graph cliping algorithm is good or not directly influence entire graphics system's performance.

图形裁剪算法是计算机图形学的基础算法，图形裁剪算法的好坏，直接影响到整个图形系统的性能。

It also constructs a lattice graph of frequent closed itemsets and generates association rules base on lattice graph.

GRG构造频繁项集的格关系图并在它的关系上生成关联规则。

X→Y has a closed graph are provided,and the classical closed-graph theorem is generalized.

本文给出了算子T具有闭图象的一些等价条件，并推广了经典的闭图象定理。

The new algorithm constructs an association graph to represent the frequent relationship between items, and recursively generates frequent closed itemsets based on that graph.

GRG算法构造关联图代表频繁项之间的频繁关系，并递归地从关联图中产生频繁闭项集。

The paper provides a method,which can automatically search next path of outline based on clockwise tread and search next path of closed graph based on counter－clockwise tread.The method improves the ancient method and increases graph making efficiency and intelligentize of CAD system.

该文提出基于顺时针行走方向搜索外轮廓下一条路径和基于逆时针行走方向搜索封闭图形下一条路径的原理和算法，改进了以往算法的不足，对提高CAD系统的图形生成效率以及系统的智能化程度等方面有着重要的意义。

Meanwhile, the experiments show that the multi-level swarm intelligence refinement algorithm is better than the multi-level tabu search refinement algorithm, especially in view of the probability that the approximate global minimum partition of the coarser graph may be the local minimum partition of the finer graph. Furthermore, the experiments show that the multi-level ant colony optimization refinement algorithm achieves more performance improvement than the multi-level particle swarm optimization refinement algorithm, using the gain of vertex more effectively.

实验数据反映出，针对最小图上的全局最优剖分可能是初始图的局部最优剖分、粗化图上的全局最优剖分可能是细化图的局部最优剖分的情况，基于群智能的多水平迁移优化算法相比基于禁忌搜索的多水平迁移优化算具备更强的逃离局部最优的能力；基于蚁群的多水平迁移优化算法相比基于微粒群的多水平迁移优化算法，对收益值的启发信息更为有效地利用，取得最佳的性能改进。

Let G be a double-outer plane graph, V, E, F be the set of points, edge and face, a plane graph G is k-total colorable, if the elements of V E can be colored with K-colors, any two distinct adjacent or incident elements receive different colors.

设G是一个双外平面图，V，E，F分别为双外平面图G的点集，边集和面集。G的全色数X是使得V∪E中的任意两个相邻或相关联的元素间均染不同颜色的最少颜色数。

The graph coloring problem is one of important branchs of graph theory.

图的着色问题是图论中的一个重要研究领域。

And based on traditional graph coloring register allocation,a new algorithm to construct unified and simplified interference graph utilizing complementary predicate is presented,which can reduce spill code.

最后在YHFT-DSP/700芯片的编译器上对所提优化方法的有效性进行了验证。1引言指令级并行(ILP，Instruction Level Parallelism)一直以来都是编译领域的一个研究热点。

Furthermore, the complexity between the relationships of synchronizability and network structural parameters are discussed via two simple graphs, and the effects of complementary graph, edge-addition and graph operation on the synchronization of complex networks are elaborated.

其次以两个简单图指出同步能力与网络结构参数的关系复杂，并给出补图与加边对同步研究的意义，然后给出图运算在复杂网络同步中的作用。

Listen,point and check your answers.

听，指出并且检查你的答案。

Warming needle is one of effective treatment methods for knee arthralgia aggravated by cold,and it is simple,safety,so it should be developed in clinical acupuncture and moxibustion extensively.

但以本院科针灸门诊在2005年1月—2006年6月期间共收治膝痛患者100余例，经过临床的诊断后，其中施以温针治疗的48例，疗效显著，报道如下。1临床资料本组病例48