-
DVBS2Constellation
The function returns constellation points and bit mappings specified in the DVB-S2 Standard. (qpsk, 32apsk, 16apsk)
- 2011-06-21 17:30:25下载
- 积分：1
-
colorspace
对于颜色空间中各种颜色空间的转换，用于提取颜色特征！MATLAB实现源码，效果不错！(For a variety of color space color space conversion, to extract color features! MATLAB source code to achieve good results!)
- 2011-10-02 22:33:11下载
- 积分：1
-
zhichixiangliangji
一款支持向量机的系列小程序，希望对大家有用吧。。(A series of small support vector machine program, we hope to be useful it. .)
- 2011-11-17 20:17:11下载
- 积分：1
-
immunity
用matlab编写的人工免疫算法，是一类模拟生物体免疫系统的功能智能仿生算法(Artificial immune algorithm written in MATLAB)
- 2015-04-02 20:40:28下载
- 积分：1
-
PPG-heart-rate-detection-
主要描述PPG进行心率检测的文档,描述了具体的一些心率的检测算法及相关的算法评定。(PPG describes heart rate testing documentation, describing some of the specific heart rate detection algorithm and related algorithms assessment.)
- 2021-03-09 13:49:27下载
- 积分：1
-
StatAnalysis
Compute Distance in a fast slam application approach
- 2011-01-27 04:56:18下载
- 积分：1
-
exercise_1
m序列产生m序列产生m序列产生m序列产生m序列产生m序列产生(m-sequence generator m sequence generation m-sequence generator m-sequence generator m sequence generation m-sequence generator)
- 2013-11-06 12:38:57下载
- 积分：1
-
NLMF
nonlocal mean for image code
- 2013-04-05 21:12:45下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
-
TOA1
TOA定位算法，包括Musica算法的具体实现，误差产生等等 (TOA location algorithm, including Musica in the proposed algorithm, the error generated, etc.)
- 2010-08-04 10:42:02下载
- 积分：1
