-
Programming_Pearls(Second_Edition)
了解快捷编程过程、技巧、方法和避免不必要的 Bug。(Understanding of the process of fast programming, techniques, methods, and to avoid unnecessary Bug.)
- 2009-07-17 14:26:43下载
- 积分：1
-
matlab
说明： matlab棒材计数的论文，对于工业棒材计数有很好的描述(matlab bar count of paper, counting for the industry have a good description of bar)
- 2010-05-04 13:39:06下载
- 积分：1
-
Kompresi-LZW
for LZW compression, it used the encode function and decode function. there s gui include in this file
- 2011-09-12 18:00:05下载
- 积分：1
-
shiyan2
一个采用神经网络拟合sin函数的matlab程序(Matlab program using a neural network to fit the sin function)
- 2013-03-11 11:43:58下载
- 积分：1
-
homomorphic-filtering-matlab-program
matlab，小波，滤波，同态滤波matlab程序，用于图像处理，滤波处理，采用matlab编写，完整文件，直接运行。(matlab, wavelet filtering, homomorphic filtering matlab program for image processing, filtering, using matlab, complete documentation, run directly.)
- 2013-10-16 22:07:45下载
- 积分：1
-
RD
RD算法作为SAR处理中最重要的处理算法，在远场近似的条件下，可将二维处理分离为两个一维处理，降低了运算量，成像效果良好。(RD算法作为SAR处理中最重要的处理算法，在远场近似的条件下，可将二维处理分离为两个一维处理，降低了运算量，成像效果良好。
RD algorithm is the most important processing algorithm in processing SAR, in the far field approximation, the two-dimensional separation into two one-dimensional processing, reduces the amount of computation, good imaging effect.
)
- 2013-12-04 16:38:24下载
- 积分：1
-
rcon-entry-v1
A GUI program for project management.
- 2015-04-11 00:06:07下载
- 积分：1
-
Segmentation
Image segmentation with gui
- 2014-11-20 00:24:12下载
- 积分：1
-
matlab
matlab学习材料，相关编程仿真，可能对初学者有用(matlab learning materials related to simulation programming, may be useful for beginners)
- 2009-06-03 11:06:00下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
|
联系客服（QQ：3324461878）
