二分图的英文

发音:

"二分图"怎么读用"二分图"造句

英文翻译手机版

bipartite graph

"二"英文翻译 two
"分"英文翻译 component
"图"英文翻译 picture; chart; drawing; map
"完全二分图" 英文翻译 : complete bipartite graph
"二分" 英文翻译 : binary search; bisect; dichotomise; dichotomize; double equinox
"部分图" 英文翻译 : partial graph
"得分图" 英文翻译 : shot chart
"分图像" 英文翻译 : partial image
"划分图" 英文翻译 : partition map
"积分图" 英文翻译 : integrogram
"可分图" 英文翻译 : separable graph
"林分图" 英文翻译 : stand map
"四分图" 英文翻译 : four view
"细分图" 英文翻译 : subdivided graph; subdivision graph
"组分图" 英文翻译 : constitutional diagram
"部分图, 零件图" 英文翻译 : part drawing
"地形分图" 英文翻译 : topographic chart
"二等分图" 英文翻译 : bisect
"分段划分图" 英文翻译 : block division plan
"肌电积分图" 英文翻译 : electromyographic integrogram
"模糊部分图" 英文翻译 : fuzzy partial graph
"区域划分图" 英文翻译 : zoning plan
"细部图,分图" 英文翻译 : detail drawing; detaildrawing
"选区划分图" 英文翻译 : constituency demarcation plan
"二分差" 英文翻译 : equation of the equinoxes

例句与用法

Independent cycles in bipartite graphs
二分图中相互独立的圈
Another one is heuristic branch - and - bound algorithm , and this algorithm just work well in moderate size
另一个算法是启发式的分支界定算法，但该算法仅仅在中等规模的二分图中可行。
In the skeleton matching , an novel approach based on weighted optimal bipartite graph matching theory is also presented
在骨架匹配方面，论文提出了一种基于加权最优二分图匹配技术的骨架匹配技术。
The model is build up by using the theory of fuzzy synthesized evaluation , the theory of binary chart matching , and data searching results
应用模糊综合评价理论、二分图匹配原理和最大数值搜索法等理论建立择优录用的模型。
But the classical vertex cover algorithm can not use in the cbvc problem directly , because the cbvc problem have more term need to constraint
但是，以上的算法并不能直接应用于受二分图约束的顶点覆盖问题( constraintbipartitevertexcover , cbvc )求解。
In chapter 3 , orthogonal factorizations of graphs , including [ 0 , k1 ] m - factorizations orthogonal to a subgraph and orthogonal factorizations of bipartite graphs , is mainly studied
第三章研究了图的正交因子分解问题，主要包括与任意图正交的[ 0 ， k _ i ] _ l ~ m -因子分解和二分图的正交因子分解
Ldpc ( low density parity check ) code is a kind of linear block code that defined by very sparse parity matrix or tanner graph , and it is also called gallager code since gallager initially presented it
Ldpc ( lowdensityparitycheck )码是一类用非常稀疏的校验矩阵或二分图定义的线性分组纠错码,最初由gallager发现,故亦称gallager码。
A number of reconfiguration strategies have been proposed for increasing the yield of such chips . a typical reconfigurable array consists of a rectangular array plus a set of spare rows ( sr ) and a set of spare columns ( sc ) . a defective element can be repaired by replacing the row or the column that contains the element with a spare row or a spare column
Kuo和fuchs [ 5 ]对该问题进行了开拓性的研究并给出了一些极有价值的结论：芯片可以抽象为一个m n的阵列，对该阵列进行修复可以归结为用sr个行和sc个列对m n的二分图进行覆盖。
Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。
Taking attributed scattering center - based classification as example , the computation of feature likelihood function under many - many and 1 - 1 correspondence are studied , by using the algorithm of bipartite graph perfect matching to find the optimal 1 - 1 correspondence , the computation efficiency is improved greatly , the relations of likelihood function between 1 - 1 and many - many correspondence are analyzed , and two sub - optimal methods of calculating the likelihood function of 1 - 1 correspondence are presented
本章以基于属性散射中心特征的分类为例，深入研究了多?多对应和1 ? 1对应特征似然函数的计算，通过将求解二分图最佳匹配的算法用于寻找特征之间的最优1 ? 1对应关系，有效提高了1 ? 1对应特征似然函数的计算效率，分析了1 ? 1对应和多?多对应特征似然函数之间的关系，给出了两种次优的1 ? 1对应特征似然函数计算方法。