Search - COST 2

Search - COST 2 - List

[Graph program] blossom.src DL : 0: 本代码执行Edmonds algorithm来进行最小代价函数，实现图形最佳匹配。参考文献："Blossom V: A new implementation of a minimum cost perfect matching algorithm."Vladimir Kolmogorov. -Edmonds algorithm the implementation of the code for the smallest cost function to achieve the best matching graphics. References:
Date : 2025-12-25 Size : 55kb User : Zhongren Wang
[Graph program] thline DL : 0: 有向直线2中值问题对于给定的有向直线L，编程计算在直线L 上增设2处服务机构的最小服务转移费用。-two straight to a mid-value problems for a given straight to the L, Programming included in the additional line L on the two services shift to the smallest cost.
Date : 2025-12-25 Size : 1kb User : tinMay
[Graph program] thline DL : 0: 有向直线2中值问题对于给定的有向直线L，编程计算在直线L 上增设2处服务机构的最小服务转移费用。-two straight to a mid-value problems for a given straight to the L, Programming included in the additional line L on the two services shift to the smallest cost.
Date : 2025-12-25 Size : 1kb User : centyear
[Graph program] BEEPS源代码 DL : 0: BEEPS图像过滤算法源代码The smoothing is applied by the way of a bi-exponential filter, itself realized by a pair of one-tap recursions. It is therefore very fast; moreover, its computational cost is truly independent of the amount of smoothing. Meanwhile, the preservation of edges is obtained by a range filter akin to the range filter found in a bilateral filter。
Date : 2014-03-03 Size : 4.55kb User : bisme2013