An experimental calculation based on the proposed matching selection for a maximum problem was performed.
以这种配对方式为基础，对一个极大值问题作了计算机模拟。
This paper proposes an algorithm of random maximum weight matching that resolves the problem while keeps a large sum of matching weight so as to preserve advantages of maximum weight matching.
该文提出随机赋权匹配算法以解决实时实现的问题，同时，使匹配的总权值依旧很大，保持了赋权匹配的优点。
We use Bayesian maximum a posteriori estimation training a speaker model from background model, to solve the problem of model miss matching in speaker verification system.
采用贝叶斯最大后验概率估计的方式，从统一背景模型中生成说话人模型。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。
应用推荐