-
question3
非线性分类器训练的快速算法设计,近邻法迭代法测试样本错误率(Fast non-linear classifier training algorithm, nearest neighbor algorithm iteration test sample error rate)
- 2011-06-06 18:06:45下载
- 积分:1
-
recordtool
Matlab code for record tool for speech recognition
- 2013-03-16 12:08:14下载
- 积分:1
-
MATLABWEVELET-EXAM
说明: MATLAB信号处理的一个小程序,是关于辅助信号处理技术与应用的,希望对大家会有用(MATLAB signal processing of a small program, on the auxiliary signal processing technology and applications, we want to be useful)
- 2010-04-10 11:23:53下载
- 积分:1
-
1
说明: 车型轮廓提取 用于车型识别中的图像预处理(Contour extraction model)
- 2010-05-19 17:46:23下载
- 积分:1
-
Matlab_Mean_Shift
edison mean shift for matlab
- 2013-09-30 01:27:08下载
- 积分:1
-
cdma
耦合影响格子序列仿真,随机性,平衡性,级多瓣分治混沌序列在cnma中的应用(Simulation of the impact of lattice coupling sequence, randomness, balance, class of chaotic sequence多瓣divided the application in cnma)
- 2009-06-03 11:45:24下载
- 积分:1
-
ok
Euclidean distance between two images
- 2013-09-20 09:28:18下载
- 积分:1
-
VelocityAnalysis
对于地震勘探中出现的速度谱进行分类和处理(For seismic velocity spectrum appears in the classification and treatment)
- 2015-01-14 16:29:27下载
- 积分: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
-
MODE
multi objective differential evolution algorithm
- 2015-04-22 08:56:37下载
- 积分:1