搜索资源列表
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
graph
- 现实生活中有很多关于流量的问题，比如说公路系统的车辆流，供水系统的水流，金融系统的金流等等。为了解决这些关于流量的问题，我们需要学习一系列关于流量的算法。-In real life there are many issues on the flow, such as road traffic flow system, water supply system, financial system, cash flow and so on. In order to solve these issues
follow
- 资料介绍了图论算法中最重要的定理之一的最小个最大流定理-Information on the graph theory algorithm, one of the most important theorem of the minimum of maximum flow theorem
A-Fusing-Color-and-Gradient-Features-Approach-to-R
- 本文通过融合图像的颜色和梯度特征 ,实现了一种实时背景减除方法。首先融合颜色和梯度特征建立新的能量函数 然后基于图切割算法最小化能量函数 ,并对前景P 背景进行分割 最后使用光流验证前景区域的真实性 ,并更新背景模型。- Based on the fusion of color and gradient features , this paper implement s a novel approach to real-time background subtraction.Firstly ,
AddFlow_ActiveX_3.0_(keygen)
- AddFlow 3.0 (keygen)AddFlow 3.0 是Lassalle开发的流程图创建工具，提供了Activex的详细接口，类似于Visio的绘图功能，使用非常方便而且功能超级强大，支持VC，VB，Dephi，Visual Studio 2005，VS2008等等，只要能支持ActiveX的就可以使用，它能够为每个图表中的对象(节点或者连接线)分配不同的颜色,字体,形状,风格,图片,文字等。节点移动后仍然保持连接。也提供自动位置的排布，推荐一用！--Flow 3.0 is a flo
Simple_MinCut
- 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 descr iption, is easy to implement, and has a surprisingly simple proof of correctness.
maxflow-v3.01.src.tar
- 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov.
DFG_fdct
- FDCT源码及其数据流图,用于图像处理或者视频编码解码-FDCT source and the data flow graph
maxflow
- Yuri Boykov s and Vladimir Kolmogorov s work on graph cuts and MRF optimization has been extensively cited in the academia, and their maximum flow implementation is widely used in computer vision and image processing research.
graphcut
- Kmeans 聚类，graphcut 图像分割,最大流最小割算法-Kmeans clustering, graphcut image segmentation, the maximum flow minimum cut algorithm
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（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, isoperi
graph.tar
- this document is a useful materials which could be used to solve the two phase flow
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
algo-implementation-for-graph-cut
- version 3.01 of max-flow algo
active-graph-cuts
- 这是对最大流/最小割算法的改进方法的文献，希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard