-
BD_channel
说明: BD算法,实现了BD预编码算法,系统吞吐量的计算,采用注水法(BD algorithm to achieve the BD pre-encoding algorithm, the system throughput computing, the use of water injection)
- 2011-03-09 17:12:23下载
- 积分:1
-
four-nodes-matlab-fem-program
四节点矩形单元matlab有限元程序,使用于一般通用程序(four nodes rectangular modules Matlab finite element program, the use of common procedures in)
- 2006-10-22 00:13:11下载
- 积分:1
-
leach
leach 仿真算法,本人从别人处得到尚未验证,大家共同讨论(leach simulation algorithm, I have not yet been verified from the others at, we discuss)
- 2011-11-19 11:22:22下载
- 积分:1
-
myASM
主动表观模型matlab程序,人脸几何特征标定(Active apperance model Matlab programming)
- 2013-10-23 21:22:19下载
- 积分:1
-
BIB_MS
matlab project synchronous machine modeling
- 2015-02-01 09:33:41下载
- 积分:1
-
AAM
主动外表模型与主动形状模型,MATLAB平台下使用,内含DEMO(active appearance model)
- 2010-12-25 20:53:26下载
- 积分:1
-
Simulink
压缩文件中是simulink的教程文件,简单介绍了matlab的simulink仿真用法(Compressed file is simulink tutorial files, a brief introduction of the use of matlab simulation in simulink)
- 2010-02-27 11:27:24下载
- 积分:1
-
mywavelete_new
读取两个文件夹中对应的图像,将两幅图像进行小波分解,修改小波系数将两幅图像的小波系数进行融合,融合后进行反变换,得到小波分解融合后的图像。(Read the two folders corresponding image, two images using wavelet decomposition, wavelet coefficients modified wavelet coefficients of the two images are fused fusion inverse transform, wavelet decomposition obtained after fusion.)
- 2015-03-26 09:26:08下载
- 积分:1
-
user
matlab simulink的直流输电模型(matlab simulink model of HVDC)
- 2014-05-09 19:57:37下载
- 积分:1
-
Dijkstra
说明: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。
Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分:1