搜索资源列表
What-energy-functions-can-be-m
- 本文首先介绍了需要通过graph cut最小化的能量函数的特性。虽然是二进制变量但是很容易推广到其他方面。我们详细描述了通过graphcut最小化的能量函数。并提供了最小化能量函数的通用构建。最后给出了最小化二进制能量函数的必要条件。,In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to
GraphAlgorithm.rar
- 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
graph_picture
- powerbuilder for graph exmple
11
- 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used singl
sql
- 图书馆管理系统开发设计方案 目录 1 需求分析 3 1.1 系统目标 3 1.2 需求定义 3 2 功能说明 4 2.1 图书基本情况 4 2.2 办理借书证 4 2.3 实现借书功能 4 2.4 实现还书功能 5 2.5 图书查询 5 3 系统功能结构图 5 4 业务流程图 6 4.1 借阅信息管理 6 4.2 书籍信息管理 6 4.3 读者信息管理 7 4.4 系统管理 7 5 绘制数据流图 7 5.1 “借书证生成”数
graph-match-PRL
- Text-independent speaker recognition using graph matching.
boundsonLDPCandLDGM
- The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. T
CPU-Graph-of-Volts-vs-Speed-Meron-Dothan-Banias.r
- Graph of Intel Mobile CPU performance at different Vcore voltages. This helps very much for underclocking/overclocking your notebooks.-Graph of Intel Mobile CPU performance at different Vcore voltages. This helps very much for underclocking/overcloc
ATULHAM
- To find Hamiltonian cycle in the undirected graph using backtracking
GraphCutsinVisionandGraphics
- Graph Cuts in Vision and Graphics:Theories and Applications-Combinatorial min-cut algorithms on graphs emerged as an increasingly useful tool for problems in vision.
dijkstra
- this program shortpathes node using graph for decide short distance in networking
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output
ASegmentationAlgorithmforContrast-EnhancedImages.r
- 基于Graph Cut的一种分割方法，比较著名的论文。-Graph Cut based on a segmentation method to compare the famous paper.
cut
- image segmentation: introduction of graph cut, grab cut, normalize cut,-image segmentation: introduction of graph cut, grab cut, normalize cut,...
source
- Very good collection of c++ source code. Implementation of diffrents alghoritms in graph theory, such as floyd,fulkerson. dijkstra,warshall, binary tree,map coloring,vertex cover.
Based-on-graph-theory-for-wireless-sensor-networks
- 基于图论的无线传感器网络自组织性能研究Based on graph theory for wireless sensor networks Performance of self-organization-Based on graph theory for wireless sensor networks Performance of self-organization
MRF--Graph-Cuts
- 课件描述了MRF Energy Minimization and Graph Cuts-Courseware describes the MRF Energy Minimization and Graph Cuts
Graph-Theory-Basic-in-Chinese
- Graph theory basic introduction in Chinese.
S7_GRAPH
- S7 Graph Design for step 7 Siemens
graph-theory-and-program-designe
- 详细的介绍了图论的各种概念如：分叉树，最短路径，遍历等以及相应的程序设计-A detailed descr iption of the various concepts of graph theory such as: the bifurcation tree, shortest path, traverse, and the corresponding program design