查询词典 graph paper

Processed coins' contour in our analysis of the experimental results, to the entire graphics coins overlap can be divided into the following three categories :(1) no overlapped circle in the graph,(2) have overlapped coins but have without the branches of points in the image,(3) have any branches in the graph, therefore, because of different circumstances should be directed to a process.

处理好的钱币轮廓依照我们实验分析的结果，将整张图形的钱币重叠情况分为下列三类：(1)无任何交叠的圆，(2)与其他钱币有交叠但无分歧点的图形，(3)图形内有分歧点者，因此，因应不同之情形有其针对的处理程序。

By using the character of Cayley graph, we establish the tight upper and the lower bounds of forwarding index for circulant graph.

利用循环图是Cayley图的性质，获得循环图的点转发指数和边转发指数紧的上界和下界。

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算法构造关联图代表频繁项之间的频繁关系，并递归地从关联图中产生频繁闭项集。

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)一直以来都是编译领域的一个研究热点。

Metrorrhagia is also gynaecological problems of common diseases.

崩漏是妇科常见病也是疑难症。

WordFTP gives you the convenience and timesaving you need.

wordftp让您的方便和省时您所需要的。