-
s_3
this function is getting the background by mean function for rael time .
the function calc the mean of every pixel .
- 2009-12-15 18:15:27下载
- 积分：1
-
fastradial
说明： 特征检测，Loy and Zelinski s fast radial feature detector.(Loy and Zelinski s fast radial feature detector.)
- 2010-03-31 09:09:04下载
- 积分：1
-
code
it is the project based on hspda coding
- 2013-04-05 04:35:30下载
- 积分：1
-
sheji
用MATLAB编写关于飞机设计的matlab程序，这个程序有助于理解和掌握用matlab编成的方法(MATLAB preparation of the aircraft design process Matlab, This process helps to understand and master the use of Matlab organization)
- 2007-07-02 15:41:26下载
- 积分：1
-
This-is-a-multi-level-voltage-svpwm-space-vector-
This is a multi-level voltage svpwm space vector control algorithm for motor controlThis is a multi-level voltage svpwm space vector control algorithm for motor controlThis is a multi-level voltage svpwm space vector control algorithm for motor control
- 2013-10-24 23:10:34下载
- 积分：1
-
PathPl
这是一篇关于移动机器人路径规划与避障的文献。很好的(This is a literature on mobile robot path planning and obstacle avoidance. Good)
- 2012-12-02 21:50:13下载
- 积分：1
-
脉冲控制多智能体一致性论文和实例仿真仿真
脉冲控制多智能体一致性论文和实例仿真仿真(Pulse Control Multi-Agent Consistency Paper + Simulation)
- 2020-09-23 10:27:49下载
- 积分：1
-
tstem.mstem
自绘图函数 数字信号处理时域绘图 丁玉美-time stem tstem mstem(Since the mapping function when the domain of digital signal processing graphics Ding Yumei-time stem tstem mstem)
- 2010-12-22 18:07:11下载
- 积分：1
-
BOC_ACF
基于matlab的BOC信号的自相关函数，阶数n可以自定义，正余弦相位也可以自定义；CBOC的自相关函数程序(MATLAB based on, BOC_ACF, n_order,CBOC_ACF)
- 2012-05-04 11:43:01下载
- 积分：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
