对于八近邻和四近邻的图像,分别建立了一组最小的完备图。
The minimum sets of complete graphs are obtained respectively for 8-site neighborhood and 4-site neighborhood digital images.
对于四近邻的图像,建立了一组最小的完备图。
The minimum sets of complete graphs are obtained respectively for 4-site neighborhood digital images.
最完备的方法是RDF:一种强大的基于图的语言,用于表示事物、属性及事物间的关系。
The most comprehensive approach is RDF - a powerful, graph-based language for declaring things, and attributes and relationships between things.
这种基于证书图的搜索算法具有很好的可靠性和完备性,更加灵活、高效,能够适应海量证书分布式存储的国际互联网。
It is shown that the algorithm has good soundness and completeness, it is more flexible and efficient and has better performance in Internet where millions of certificates are distributed stored.
为实现具有工程化特征的数字成图生产工艺奠定完备的分类参数模型基础。
It also lays a complete foundation for classifying parameter model in order to realize digital mapping technology with engineering feature.
本文讨论了若干图类的四种不同的着色问题:动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题:动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
应用推荐