1) minimal partition problem
最小分割问题
1.
A novel hierarchical Mumford-Shah functional model is addressed to simultaneously segment, denoise and reconstruct the data within a given vector-valued image such as a color image, and to handle important image features such as triple points and other multiple junctions, which can be seen as a hierarchical case of the Mumford-Shah minimal partition problem for vector-valued images.
该模型是Mumford- Shah“最小分割问题”的向量值图像“多层”实现模型。
2) Max-cut problem
最大割问题
1.
The branch-and-bound algorithm for max-cut problem;
求解最大割问题的分枝定界算法
2.
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
3.
This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory.
交叉熵方法(Cross Entropy)是近几年发展而来的一种启发式方法,在求解组合优化问题中显示出其简单有效的特点,将运用交叉熵方法(CE)寻求图论中一个典型的NP困难问题—最大割问题的最优解。
3) max-min allocation problem
最大-最小分配问题
4) min cut
最小分割
5) max dicut problem
最大有向割问题
1.
A new approximate method is presented for max dicut problem with given size of the parts,and its performance guarantee is analysed.
给出了求解给定部分大小的最大有向割问题的一种新的近似方法,并讨论了它的性能保证。
6) Least element problem
最小元问题
1.
The relations of the vector F-complementarity problems, general vector variational inequalities, and least element problems of feasible set are given under certain conditions.
本文引入几类向量F-互补问题，并在一定条件下给出了向量F-互补问题，广义向量变分不等式以及可行集的最小元问题之间的相互关系。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条