资源列表
cut-the-minimum-cut-problem
- 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)
test_GMP
- 已设置好的VC6.0环境下可用GMP大数库的源代码-Tarsus GMP library available under VC6.0 environment has set a good source
CPP_ESsential_Numerics
- Essential numerical procedures for NM
MATLAB
- 使初级工程师能够较快速的了解MATLAB这一数学工具，以及初步掌握用法-Junior engineers can more quickly understand the mathematical tools of MATLAB, as well as preliminary master the usage
TurboPixels
- 利用turbopixel的超像素图像分割方法，可以显示不同块的颜色。-This is a mex c and matlab code, which uses the turbopixel to segment the object from the image.
window function contrast
- 矩形窗，三角窗，汉宁窗，汉明窗，布莱克曼窗，巴特利特窗频谱对比图(The triangular window, rectangular window, Hanning window, Hamming window, Blackman window, Bartlett window spectrum comparison chart)
上位机
- MAtlab GUI实现的WiFi串口通信(MATLAB GUI WiFi serial communications)
IJETAE_0314_29
- Using MATLAB Radio System Analysis
pharacter_delete
- 可是输出N条相同边的最短路径程序！！！！！！！1()
1-Writing User Subroutines with ABAQUS
- ABAQUS平台，用户子程序编写教程，基础教学说明(abaqus user subroutine course)
启发式算法
- 利用启发式算法解决图着色问题，包括禁忌表，仇人表等一系列操作(Solving the problem of graph coloring with heuristic algorithm)