说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 侧廓
1)  profile [英]['prəʊfaɪl]  [美]['profaɪl]
侧廓
1.
NP-completeness of the Profile Problem and the Fill-in Problem on Cobipartite Graphs;
偶图的补图的侧廓问题和填充问题的NP-完全性(英文)
2.
The profile minimization problem is to find a one-to-one mapping f from the vertex set V(G)of a graph G to the set of positive integers{1,2,…,│V(G)│} such thatx ∈V(G)∑ (f(x)-min f(y) is as small as possible,where N *(x) is the closed neighborhood of x in G.
侧廓问题是:寻找一个从V(G)到正整数集合{1,2,…,│V(G)│}的一个一一对应,让x∈V(G)∑ (f(x)-min f(y)尽可能小,这里y∈N*(x),N*(x)是x的闭领域。
3.
The profile minimization problem is to find a one-to-one mapping f from the vertex set V(G)of graph G to the set of positive integers{1,2,…,│V(G)│}such that Σ x∈V(G)(f(x)-min y∈N*(x)is as small as possible,where N* (x) is the closed neighborhood of x in G.
侧廓问题是:寻找一个从V(G)到正整数集合{1,2,…,│V(G)│}的一个一一对应,使Σ x∈V(G)(f(x)-min y∈N*(x)f(y))尽可能小,这里y∈N(*x),N(*x)是x的闭邻域。
2)  extended profile
扩充侧廓
1.
The extended profile problem of a graph of the storage and elimination technique in 1950 s is to find a set F with least edges in graph G,and make the graph G+F is a proper interval graph.
起源于20世纪50年代的稀疏矩阵的存贮和消去技术的图的扩充侧廓问题就是在一个图G中寻求一个内含边数最小的边集F,使得超图G+F是单位区间图。
3)  skew-back profile
侧斜叶廓
4)  correction of motion
侧视轮廓
5)  side marker lamp
侧示廓灯
6)  face profile
侧面轮廓
1.
A new method which combined face profile,ear feature and relative position of ear and face profile to detect and recognize human ear is proposed in this paper.
为实现人耳的自动检测与识别,提出了结合侧面轮廓特征、人耳统计特征以及人耳与侧面轮廓的位置特征进行人耳检测与识别的方法。
补充资料:廓廓
1.安定貌。 2.辽阔貌。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条