-
pade
The Pade method of finding AR MA ARMA model coefficients
- 2011-11-15 00:10:30下载
- 积分：1
-
MOTAILIFA(bukaolvouhe)
不考虑模态耦合项的多阶模态力法，是楼文娟文章中的程序(Without considering modal coupling term multi-modal legislation, LOU Wen-juan article in the program)
- 2020-11-11 15:19:45下载
- 积分：1
-
Dec_eq_temps
We programmed the correction equation of time in minutes per day pendants year
- 2014-11-20 20:14:14下载
- 积分：1
-
ECG-with-WT
ECG signal processing with Matlab
- 2012-02-13 00:32:16下载
- 积分：1
-
qianru
通过在语音信号中嵌入鲁棒性水印和脆弱性水印，实现对数据的版权保护。(Embedded in the speech signal through robust watermarking and fragile watermarking, copyright protection to achieve the data.)
- 2010-06-12 21:40:45下载
- 积分：1
-
mfilesfromAntennaandemmodelingwithmatlabbyMakarov
antenna and Electromagnetic modulation surce code
- 2009-06-30 12:33:46下载
- 积分：1
-
SpringerOrthogonalFrequencyDivisionMultiplexingFo
Springer - Orthogonal Frequency Division Multiplexing for Wireless Communications
- 2011-01-12 08:43:56下载
- 积分：1
-
imaqacdemo3
说明： 基于MATLAB实现实时视频监控系统的实现与源代码(MATLAB-based real-time video monitoring system of the source code)
- 2011-03-21 12:29:11下载
- 积分：1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分：1
-
dijkstra
digstra algorithm for shortest paths
- 2011-11-28 19:46:08下载
- 积分：1
