Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - minimum cut

Search list

[WEB Code] 最大流最小割定理

Description: 最大流最小割定理-maximum flow minimum cut theorem
Platform: | Size: 2040 | Author: 张志明 | Hits:

[GDI-Bitmap] graphcut

Description: 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
Platform: | Size: 451153 | Author: adan | Hits:

[Mathimatics-Numerical algorithms] MaxStream

Description: 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
Platform: | Size: 2026093 | Author: 水中雁 | Hits:

[Documents] 最大流最小割定理

Description: 最大流最小割定理-maximum flow minimum cut theorem
Platform: | Size: 2048 | Author: 张志明 | Hits:

[Mathimatics-Numerical algorithms] MaxStream

Description: 学习VC的时候写的，求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
Platform: | Size: 3965952 | Author: 水中雁 | Hits:

[GDI-Bitmap] graphcut

Description: 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
Platform: | Size: 450560 | Author: adan | Hits:

[Data structs] stream

Description: 网络流算法 涉及：数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
Platform: | Size: 91136 | Author: sql | Hits:

[Special Effects] MinCutAlgorithm

Description: 这是自己用c#写的一段关于图的最小切的算法，主要参考了论文： 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis:
Platform: | Size: 3072 | Author: 张曦 | Hits:

[Special Effects] 3_MinCut

Description: 一个经典的求解最大流最小割代码 VC++版本-A classical solution of maximum flow minimum cut code VC++ Version
Platform: | Size: 18432 | Author: wangfei | Hits:

[Windows Develop] graph_cut

Description: 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
Platform: | Size: 6144 | Author: wujinjie | Hits:

[Software Engineering] GraphAlgorithm

Description: C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版-C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates
Platform: | Size: 11264 | Author: jz | Hits:

[Special Effects] maxflow-v3.0

Description: 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
Platform: | Size: 61440 | Author: jiangkaihua | Hits:

[Graph program] Simple_MinCut

Description: Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about uVu nearly identical phases each of which is a maximum adjacency search.
Platform: | Size: 2048 | Author: Daniel | Hits:

[Search Engine] Ncut

Description: 本文介绍了web文本聚类的流程，着重介绍了Normalized Cut谱聚类的原理和算法，提出以Minimum cut作为类内部的内聚强度作为衡量Normalized Cut的迭代停止条件
Platform: | Size: 874496 | Author: cc | Hits:

[Special Effects] graphcut

Description: Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm
Platform: | Size: 13636608 | Author: 邓民明 | Hits:

[Special Effects] graph-based-image-segmentation

Description: 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker.
Platform: | Size: 7720960 | Author: zc | Hits:

[matlab] max-flow-min-cut-theorem

Description: 初学最大流最小割的几个很有用的参考资料，详细介绍了它的应用，很有帮助哦！-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
Platform: | Size: 4034560 | Author: wade | Hits:

[Data structs] cut-the-minimum-cut-problem

Description: cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E) of the cut cut (S, T) is the vertex set V of G into two disjoint subsets S and T, so that s Î S, t Î T, and cut ( S, T) = {(u, v) Î E | u Î S, vÎ T}. Let each edge (u, v) the right side is a (u, v), then cut cut (S, T) has a weight cut (S, T) and the rights of all sides. Minimum cut problem requires a network G, the minimum weight cut.
Platform: | Size: 336896 | Author: yjian | Hits:

[Internet-Network] algorithm-of-minimum-cut-sets

Description: 求最小割集的近似算法，具有近似性的保证，可用于社会网络的分析以及求图的最小割集。-trives for the approximate algorithm of minimum cut sets, with approximate guarantee, can be used for the analysis of social networks and strives for the minimum cut set of the graph.
Platform: | Size: 1281024 | Author: 达松 | Hits:

[Special Effects] Graph_Cut (C++代码)

Description: 利用最大流最小割的原理，实现了graph cut对图像的分割，方法简单，易于理解(Using the principle of maximum flow minimum cut, graph cut can be used to segment images. The method is simple and easy to understand.)
Platform: | Size: 787456 | Author: 小豆豆43328 | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net