-
7-DIPUM-Code
Basics in Image processing using MATLAB
- 2009-06-09 12:35:41下载
- 积分：1
-
l1magic
说明： 基于内点法的解l2_l1和l2_TV优化问题的matlab代码(Interior point method based on the solution l2_l1 and optimization problems l2_TV code matlab)
- 2008-11-20 20:02:52下载
- 积分：1
-
AvgFilter
simple problem average filter
- 2012-05-09 19:45:44下载
- 积分：1
-
GREEDY
这是我们参加深圳杯2012年D题的打孔机生产效率的问题，希望对大家有帮助。这可是很强的东西。(This is our participation in Shenzhen Cup 2012 theme punch D productivity problem, we want to help. This is strong stuff.)
- 2013-07-31 10:01:26下载
- 积分：1
-
37626
概率论与数理统计的matlab程序，对于解决概率论的问题很有帮助(Probability Theory and Mathematical Statistics matlab program for solving the problem of probability theory is helpful)
- 2014-02-16 10:32:25下载
- 积分：1
-
利用自相关法，计算基音周期，结果给出对应的时间值坐标
利用自相关法，计算基音周期，结果给出对应的时间值坐标。(The pitch period is calculated by the autocorrelation method, and the corresponding time value coordinate is given.)
- 2020-06-27 02:00:02下载
- 积分：1
-
ivdf_fusebundle_nt_en
mat lab tool for k-median algorithnm
- 2010-01-11 17:57:36下载
- 积分：1
-
localiaztion2010
为IEEE TRANSACTIONS ON SIGNAL PROCESSING 的信号源被动定位与跟踪领域的经典文章“Alleviating Sensor Position Error in Source Localization Using Calibration Emitters at Inaccurate Locations”的实现程序。(For the IEEE TRANSACTIONS ON SIGNAL PROCESSING passive source localization and tracking areas of classic article " Alleviating Sensor Position Error in Source Localization Using Calibration Emitters at Inaccurate Locations" implementation process.)
- 2011-11-28 09:59:36下载
- 积分：1
-
umlspecification
《OMG Unified Modeling Language Specification》,一本对uml介绍非常详细全面的书。( OMG Unified Modeling Language Specification , 1 pairs of UML introduced a very detailed and comprehensive book.)
- 2007-12-09 10:49:11下载
- 积分：1
-
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, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
- 2010-03-28 15:39:29下载
- 积分：1
