Location:
Search - cut
Search list
Description: cut.c
给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？
Platform: |
Size: 78802 |
Author: 王刚 |
Hits:
Description: segment on graph cut
Platform: |
Size: 21030 |
Author: jinre9821 |
Hits:
Description: 基于graph-cut的背景减除算法。.....
Platform: |
Size: 632692 |
Author: dsszcp |
Hits:
Description: max flow/min cut 实现最大流最小割算法的程序
Platform: |
Size: 15006 |
Author: qinchanchan@163.com |
Hits:
Description: IEC 60793-1-44 Optical fibres - Measurement methods and test procedures - Cut-off wavelength
Platform: |
Size: 430585 |
Author: xveenxvaan@gmail.com |
Hits:
Description: 最大流最小割定理-maximum flow minimum cut theorem
Platform: |
Size: 2048 |
Author: 张志明 |
Hits:
Description: 一个不错的C#记事本,实现了基本的剪贴,复制,粘贴...换有打印,页面设置,很类似于Windows自带的记事本啊,很不错啊,一定要看.-a good C# notebook, the realization of the basic cut-and-paste, copy, paste ... for a print page setup, very similar to the Windows Notepad ah, which was very bad thing, we depend on.
Platform: |
Size: 78848 |
Author: 刘三石 |
Hits:
Description: 直线的裁剪 直线的裁剪-cutting straight line cut straight cutting line cut straight cut
Platform: |
Size: 48128 |
Author: |
Hits:
Description: 计算机视觉中Stereo Vision的Graph Cut实现。一个比较Robust的算法。-computer vision Stereo Vision Graph Cut achieve. A more robust algorithm.
Platform: |
Size: 637952 |
Author: 金革 |
Hits:
Description: 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
Platform: |
Size: 450560 |
Author: adan |
Hits:
Description: cut bmp file from the column direction. User can choose where the image should be cut.-cut bmp file from the column direction. Use r can choose where the image should be cut.
Platform: |
Size: 1024 |
Author: 张希勇 |
Hits:
Description: 这是N-Cut算法的matlab程序，可用于图像分割等-This is the N-Cut algorithm Matlab procedures can be used for image segmentation, etc.
Platform: |
Size: 47104 |
Author: maggie |
Hits:
Description: Normalized cut code in matlab -Normalized cut code in Matlab
Platform: |
Size: 160768 |
Author: 李艷 |
Hits:
Description: the newest graph cut source code and there are some new algorithm in it-the newest graph cut source code and there a 're some new algorithm in it
Platform: |
Size: 644096 |
Author: 薛全 |
Hits:
Description: 干涉合成孔径雷达成像的相位解缠的枝切法程序。-Interferometric synthetic aperture radar imaging of the phase unwrapping process of the branch-cut method.
Platform: |
Size: 13312 |
Author: wang yan |
Hits:
Description: 完成计算机图形学中图形的裁剪，首先绘制四边形，然后绘制直线，将四边形外的部分裁剪掉。-Completion of computer graphics in the cut graph, first of all draw quadrilateral, and then draw a straight line will be outside the quadrilateral part of cutting out.
Platform: |
Size: 1627136 |
Author: rebecca |
Hits:
Description: 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of branch and bound and cutting plane methods.
Platform: |
Size: 1384448 |
Author: abrahamlau |
Hits:
Description: image segmentation: introduction of graph cut, grab cut, normalize cut,-image segmentation: introduction of graph cut, grab cut, normalize cut,...
Platform: |
Size: 12322816 |
Author: Yun-Ru Sun |
Hits:
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:
« 12
3
4
5
6
7
8
9
10
...
50
»