-
MATLABcode
包括IHS遥感图像融合算法,比较全。基于MATLAB。(IHS image merging)
- 2009-05-29 23:44:40下载
- 积分:1
-
3_2006011134
matlab,信号与系统大作业3,非常实用(matlab)
- 2010-08-30 10:28:24下载
- 积分:1
-
RobotSoccerSysV1.0
When I studied at Peruvian university computer science , We developed a computer vision software about mini robot soccer. And I want to share it It was a first version.
- 2014-11-28 11:19:41下载
- 积分:1
-
IECRS-reduce
变压器油中溶解气体的故障诊断方法,即IEC三比值法。用Matlab 程序运用的结果进行整理而得到的约简后的故障诊断决策表(Dissolved gases in transformer oil fault diagnosis method, that is, three-ratio method IEC. Matlab program used to collate the results of the application obtained after reduction of the fault diagnosis decision table)
- 2009-04-15 16:26:18下载
- 积分:1
-
VQ
说明: program c++ for vector quantization use k-means
- 2015-04-19 21:37:55下载
- 积分:1
-
TCCI_2011_edge
matlab based edge detection method
- 2012-05-01 13:17:41下载
- 积分:1
-
ami.hdb3
ami ,hdb3码的编解码过程,这是在matlab中实现的,但是对我们的编程也很有用处(ami, hdb3 code encoding and decoding process, which is implemented in matlab, but may also be useful to our programming)
- 2011-05-27 18:45:43下载
- 积分:1
-
chuanshujuzhen_20101130
计算随机薄膜厚度的反射率和透射率,利用传输矩阵编写(Random film thickness calculated reflectance and transmittance, written using the transfer matrix)
- 2020-09-15 16:37:57下载
- 积分:1
-
3
说明: IMPARARE IL C++ in 2 ore e mezzo?
Modulo-3
- 2015-03-10 23:13:52下载
- 积分: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