-
ezw
embedded zero tree coding
- 2010-09-18 17:19:52下载
- 积分：1
-
tyhuk
Pattern recognition using matlab software had a very good simulation, the use of Bayesian Classifiers for boys and girls had a very good classification.
- 2010-10-18 22:13:25下载
- 积分：1
-
GraidFeature
基于matlab的纹理特征提取
基于灰度共生矩阵的纹理特征(Texture feature extraction based on matlab GLCM-based texture features)
- 2010-05-16 18:31:10下载
- 积分：1
-
5
说明： matlab SIMULINK Arabic tutorial part 5
- 2014-10-10 14:04:12下载
- 积分：1
-
liquid
利用matlab软件，求解二维流体传热算例(Using matlab software for solving two-dimensional fluid heat transfer numerical example)
- 2013-11-21 20:12:16下载
- 积分：1
-
faotie_v35
LZ复杂度反映的是一个时间序列中，isodata 迭代自组织的数据分析，计算一维光子晶体的透射特性和反射特性。( LZ complexity is reflected in a time sequence, Isodata iterative self-organizing data analysis, Calculated transmission characteristics and reflection characteristics of the one-dimensional photonic crystals.)
- 2016-05-17 11:03:38下载
- 积分：1
-
somepictures
Some special graphs drawn in Matlab,hope to use and helpful.(Some special graphs drawn in Matlab, hope to use and helpful.)
- 2010-08-25 14:36:16下载
- 积分：1
-
moscnt.1.0
说明： 基于matlab的纳米级碳纳米管晶体管仿真程序(nanotube transistor simulation)
- 2009-08-31 19:46:38下载
- 积分：1
-
ACO_on_JSSP
ant colony optimization technique for JSSP
- 2012-03-25 01:22:36下载
- 积分：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
