
词语导航
基本信息
词语:图着色
繁体:圖著色
拼音:tú zhuó sè
英语翻译
【计】 graph coloring
分词翻译
图的英语翻译:
chart; drawing; fig.; map; plot; picture; intention; attempt; plan
【计】 diagram; graphtyper
【化】 diagram
【医】 chart; column diagram; diagram; graph; map; picture; schema; scheme
sheet
着色的英语翻译:
dye; put colour to; stain
【计】 colouring
【医】 chromatosis; pigmentation; tinction
翻译例句
1. 图着色问题是著名的NP-完全问题。
The graph coloring problem is a well-known NP-complete problem.
2. 图着色问题是著名的NP-完全问题。
Minimum Steiner tree problem is NP complete problem.
3. 图着色问题(GCP)是NP完全问题。
Graph Coloring problem (GCP) is an NP hard problem.
4. 固定:黑人头发显示器的硬边,调整抠图着色器。
Fixed: Afro hair showed hard edges on cutout, adjusted cutout shader.
5. 基于图着色问题的特点,设计了一种新的、有效的杂交算子。
An effective crossover is designed according to the characteristic of the GCP.
6. 这一步很简单的,用喷枪工具直接在色彩模式下对当前图着色就可以完成了。
This was done very simply by painting over the current image with the airbrush in color mode.
7. 研究基于图着色理论的频谱分配算法,提出一种改进的最大效用频谱分配算法。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
8. 利用寄存器分配原理,构造图着色模型和函数,通过修改图结点颜色实现二进制水印信息位的嵌入。
The watermarking binary is embedded by using the principle of register allocation, constructing the graph coloring model and function and changing the nodes colors in the interfere graph.
9. 高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中,然而寻找图着色所需的最小颜色数目是个NP难题。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
10. 这些设计图通常都经过渲染着色,非常漂亮;但同样也有很多是好玩的草图,这些草稿就像是从哪位鲁莽的教授脑子里跳出来的一样。
Schematics are often beautifully rendered, but they"re also just as often quick entertaining sketches that appear to have sprung out of the mind of some madcap Professor.
11. 对每一块的细微纹路进行着色能突显出神经细胞的主体部分(上面略带紫色的图)。图中的偏暗区域代表了大脑表明的高细胞密度区域。
Staining of a thin sliver of each block can highlight the main bodies of nerve cells (top, purplish image) with the darker areas indicating high cell density near the brain"s surface.
12. 图7:由系统组件所着色的项目团队成员的工件分配。
Figure 7: Project team member assignment of artifacts colored by system component.
13. 异或的效果虽然不是如 图1 所示的结果,但它确实表明了composite是如何负责在图标的绘图表面上进行着色的。
The XOR effect is not the result shown in Figure 1, but it does show how the composite is responsible for rendering the icon onto the drawing surface.
14. 下一步是创建能够将初始图标包装起来并用图1所示的图形效果给图标着色的rollovericon类。
The next step is to create the RolloverIcon class that is able to wrap an original icon and paint it with the desired graphics effect shown in Figure 1.
15. 到目前为止,对于一般的图,全着色猜想仍然是一个公开的问题。
So far, for any graph, the Total Coloring Conjecture is still an open problem.
16. 然后,我们将收官培训跳回到UD K并学习如何建立一个水着色器,将利用我们的MARI创造流量图。
Then we"ll wrap up the training by jumping back into UDK and learn how to set up a water shader that will utilize our MARI created flow map.
17. 本文讨论了若干图类的四种不同的着色问题:动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
18. 采用丝网印刷、蚀刻、化学着色等工艺方法进行不锈钢板图纹装饰,所得图纹清晰,装饰效果明显,具有广泛推广价值。
Decorative patterns on stainless steel sheet was fabricated through silk screen printing, etching and chemical colouring, patterns obtained were clear and have good decorative result.
19. 图的邻强边着色算法是一个NP完全问题。Www.weNTiyI.COM
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
20. 图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
21. 其次,文章研究了平面图的列表着色问题,给出了平面图3 -可选的一个充分条件。
Secondly, we investigate the list coloring of planar graphs, and give a su? Cientcondition for a planar graph being 3-choosable.
22. 如果在一个图的正常边着色中,相邻两点关联的边集所着的颜色集合不同,则称此正常边着色为相邻强边着色。
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.
23. 你也可以指定背景图象的上颜色,也可以给应用程序设计的图标命名和给字体着色。
You can also specify a background image for the home screen and change the color of the home screen font that displays the application name.
24. 图的着色理论是图论的重要分支之一,是图论研究中的最活跃的课题之一。
The chromatic theory of graphs is one of the most important branches of Graph Theory.
25. 研究一类特殊的本原双色有向图,其未着色的有向图包含两个圈。
Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.
26. 讨论了图的二人对策着色和放松对策着色,给出了轮图与扇图的对策色数与放松对策色数。
In this paper, we obtain the game chromatic number and relaxed game chromatic number of wheel and fan.
27. 具有准强边着色的图称为准强边着色图,并对准强边着色图给出一个分类。
The graph with a quasi-strong edge colourings is called the quasi-strong edge colouring graph. This paper gives a classification for the quasi-strong edge colouring graphs.
28. 具有准强边着色的图称为准强边着色图,并对准强边着色图给出一个分类。
The graph with a quasi-strong edge colourings is called the quasi-strong edge colouring graph. This paper gives a classification for the quasi-strong edge colouring graphs.
版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!
