-
minRoute
matlab求最短路径的Dijkstra算法，使用说明很清楚，简单易用(matlab seek the shortest path Dijkstra algorithm, instructions are clear, easy to use)
- 2010-09-07 14:26:49下载
- 积分：1
-
dsb-ssb-am-
单边带调制 双边带调制 幅度调制源代码 检验过了可以用的(Bilateral single-sideband amplitude modulation with the source code can be used)
- 2011-04-25 14:47:32下载
- 积分：1
-
boostconverter
simulink model for boost converter
- 2011-08-28 03:14:23下载
- 积分：1
-
slmwithpr
OFDM along with SLM technique
- 2014-11-16 02:04:37下载
- 积分：1
-
dongtaidianlixitongfenxi
适用于matlab或者c++，电力专业的学生如需掌握电力知识必看的一本书(Suitable for matlab or c++, electricity majors To grasp the power of knowledge must see a book)
- 2015-04-11 15:04:58下载
- 积分：1
-
Binarygeneticalgorithm
binary genetic algorithm
- 2010-07-08 21:49:07下载
- 积分：1
-
data_whitening
蓝牙物理层data whitening编码，数据白噪声化，目的是对数据进行离散化操作。(bluetooth PHY data whitening)
- 2015-01-19 13:47:41下载
- 积分：1
-
trackbydet
这是用于城市环境下车辆目标跟踪算法，对于公路上录制车辆的视频，能够检测出前方运动的车辆，并进行跟踪。(This is the tracking code that has been used for computing the tracklets
urban scene understanding.
papers: author = {Hongyi Zhang and Andreas Geiger and Raquel Urtasun},
title = {Understanding High-Level Semantics by Modeling Traffic Patterns},
booktitle = {ICCV},
year = {2013})
- 2016-01-20 19:45:30下载
- 积分：1
-
QuadTRee
使用C++和matlab混合编程实现四叉树分解及合并区域的代码(C++ and matlab mixed programming quadtree decomposition and Mergers area code)
- 2013-04-23 20:11:39下载
- 积分：1
-
bottom_up_segmentation
这是TD算法的逆过程，首先将时间序列，划分为相邻点的短序列，当然此时的拟合误差为0，因为第一点和第二点的连线，原始点都落在线段上。将相邻两个线段连接起来，此时每条线段包含三个原始点，计算中间那个点的拟合误差。这样，所有这些三个点的线段中的中间点的拟合误差计算出来后，找出误差最小且误差小于阀值R的分段，作为第一条包含三个点的线段。 在上面的基础上，第一条分段同样的和相邻线段连接，然后计算每一条分段的拟合误差，再找出误差最小且小于阀值R的分段，作为第二个分段。依次方式循环，直到所有分段的拟合误差都小于阀值R，分段结束。
(This is the reverse process of TD algorithm, the first time series is divided into short sequences adjacent dots, of course fitting error is zero at this time, because the first and second points of connection, the original point fall line on. The two adjacent segments are connected, then each segment contains three original point, the intermediate fitting error calculated that point. Thus, after all these segments fitting error of three points in the intermediate point calculated to find the minimum error and the error is less than the threshold R segment, as the first line contains three points. Based on the above, the first segment and the adjacent line segment connecting the same, and then calculate a fitting error for each segment, and then find the smallest error and less than the threshold R segment, as the second segment . Followed by a cyclic manner until all segments fitting error is less than the threshold R, segment ends.)
- 2021-03-20 16:29:18下载
- 积分：1
