登录
首页 » matlab » adaboostNewDemo

adaboostNewDemo

于 2011-01-23 发布 文件大小:1KB
0 147
下载积分: 1 下载次数: 2

代码说明:

  Creating the training and testing sets

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • lmsxx
    毕业设计时做的算法,直接运行就可出图,比较的话可以该参数。(do graduate design algorithm can be run directly from the map, so can compare the parameters.)
    2007-05-22 16:23:33下载
    积分:1
  • zgx
    自适应预测,可用于预测已知信号的未来时间序列(Adaptive prediction)
    2014-12-24 20:08:19下载
    积分:1
  • ccallmatlabfunc
    C#调用matlab函数的方法(The function that c# invokes matlab )
    2005-02-20 13:39:25下载
    积分:1
  • SMI
    基于采样矩阵求逆算法的自适应数字波束形成器程序(Sample matrix inversion algorithm based on adaptive digital beamformer program)
    2011-06-30 16:41:12下载
    积分:1
  • QAM
    Implementation of Quadrature Amplitude Modulation-Demodulation
    2013-12-04 20:09:31下载
    积分:1
  • BP神经网络分类
    说明:  BP神经网络分类程序 学习分类方法 多个程序都可以运行 数据处理(BP neural network classification program learning classification method multiple programs can run data processing)
    2020-02-07 18:02:03下载
    积分:1
  • 119128624mimo_waterfilling
    mimo系统注水算法。。。。。。。。。。。。。。。。。。。。。。。。。。。(mimo systems injection method. . . . . . . . . . . . . . . . . . . . . . . . . . .)
    2010-05-26 00:02:06下载
    积分:1
  • shili58
    制作动态圆周点动的源代码,在matlab中能够完美运行。(Making dynamic circle to move the source code, can be the perfect operation in matlab.)
    2014-12-26 18:49:53下载
    积分: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 &lt = L &lt = 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 &lt = M &lt = 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 &lt = L &lt = 10000) and M (1 &lt = M &lt = 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
  • PBG
    二维光子晶体禁带的遗传优化算法,在平面波展开法的基础上,使用遗传算法寻找具有最大光子禁带的二维光子晶体结构(Two-dimensional photonic crystal band gap genetic algorithm, in the plane wave expansion method based on the use of genetic algorithms to find a maximum two-dimensional photonic band structure of photonic crystals)
    2011-04-28 23:20:33下载
    积分:1
  • 696518资源总数
  • 105714会员总数
  • 27今日下载