-
Planning
主要为matlab中解决数学规划问题的源程序,及讲解优化问题的课件(Planning)
- 2010-07-11 13:06:10下载
- 积分:1
-
code-mophong-hinh-1-2-3
mo phong STC trong MIMO OFDM
- 2015-03-30 10:46:37下载
- 积分:1
-
pink-noise-denoise-by-PCG-signal
this matlab code denoise the pink noise from pcg signal and generate the specogram
- 2014-02-21 21:40:30下载
- 积分:1
-
askdemodwork
Amplitude Shift Keying (ASK) modulation with using MATLAB simulink.
- 2010-11-28 02:13:50下载
- 积分:1
-
HARRSI
Harris角点检测算法,应用于图像的形状检索(Harris corner detection algorithm applied to the shape of the image retrieval)
- 2011-11-01 18:57:28下载
- 积分:1
-
Digital-Image-Processing
数字图像处理(Digital Image Processing)是通过计算机对图像进行去除噪声、增强、复原、分割、提取特征等处理的方法和技术。本书是数字图像信息处理领域的一本经典著作,是20多年来此领域最权威的教材之一。(Digital Image Processing (Digital Image Processing) is performed by a computer of the image to remove noise, enhancement, restoration, segmentation, feature extraction and other processing methods and techniques. This book is the digital image information processing field a classic book and is one of the most authoritative textbook in this field for over 20 years.)
- 2014-12-08 16:31:15下载
- 积分:1
-
signt
标记分水岭算法,可用于彩色图像的分割。通过标记局部极小值实现。(label)
- 2010-05-20 21:10:06下载
- 积分:1
-
ESmart
智能天线系统的matlab仿真程序 大家(Smart Antenna System Matlab simulation program we look at)
- 2007-01-05 15:29:32下载
- 积分:1
-
4
说明: INS_OUT一个关于惯性导航解算的程序源代码,本人的研究结果。(INS_OUT a about inertial navigation the solution of the source code, I study results.
)
- 2011-12-14 20:11:11下载
- 积分: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