-
session2
slam进阶学习,老外做的,很完善的东西,对于同时定位与地图创建的friend有很大的帮助(第二课)(err)
- 2008-04-29 14:59:10下载
- 积分:1
-
MATLAB
这个是逐步搜索法的MATLAB主程序,牛顿法,不动点迭代法(This is a step by step search method MATLAB main program, compiled his free time, by running the verification.)
- 2009-12-01 21:09:14下载
- 积分:1
-
clusterValidityAnalysisPlatform3.42
We present in this paper a new method for blind source separation
which is adapted to the case where the sources have different morphologies.
We show that the morphology diversity concept leads to a
new and very efficient method, even in the presence of noise.
- 2013-09-26 13:15:48下载
- 积分:1
-
无线通信多径衰落信道的Matlab仿真
通过将喷泉码的编译码方法再无线衰落信道上的用matlab仿真出来(Multi-path ruili channel simulation research on matlab)
- 2018-12-29 09:44:50下载
- 积分:1
-
Smpc
此程序为模型预测控制算法中的动态矩阵控制算法,依据算法的控制思想,实现基本的控制。(This procedure is belong to the model predictive control. It is the DMC algorithm with real-time update module calculation, to complete the cycle simulation.)
- 2013-12-05 09:25:42下载
- 积分:1
-
4
说明: salam. this file is about cryptography.
- 2009-12-31 20:39:29下载
- 积分: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
-
three_phase_current_loop_grid
Three phase curretn loop invereter
- 2013-04-10 18:36:33下载
- 积分:1
-
graphcuts
This program segments the objects by GraphCut Algorithms.
- 2015-03-01 13:43:00下载
- 积分:1
-
MIMO
自己作的仿真MIMO_SIMULATION,可以正常运行(MIMO_SIMULATION)
- 2009-04-05 19:06:48下载
- 积分:1