-
gsi16
徕卡1200数据传输很好用的格式文件，供大家参考使用 (Excellent Leica 1200 data transmission format used for your reference to use)
- 2010-03-12 11:45:04下载
- 积分：1
-
sparse_coding_for_classification
简单的sparse coding的小程序，基本可以了解sparse coding的工作过程。(Simple sparse coding small procedures, the basic can understand the working process of sparse coding.)
- 2014-10-27 22:24:21下载
- 积分：1
-
stm32_eval
OMAP_MUX_MODE7 | AM33XX_PULL_ENBL | AM33XX_PULL_UP| AM33XX_PIN_OUTPUT
- 2013-12-30 17:07:45下载
- 积分：1
-
EasyWin
掌握开发环境，创建首个Windows程序，理解编译、运行和调试的基本概念(Master development environment to create the first Windows program, to understand the basic concepts of compiling, running and debugging)
- 2015-04-20 22:48:15下载
- 积分：1
-
Matlab
Matlab实现数值分析中三次样条差值、非线性方程组等的相关例证(Matlab to achieve numerical analysis cubic spline difference, nonlinear equations and other relevant examples)
- 2015-03-23 19:14:20下载
- 积分：1
-
Matlab-Simulation-Files
Matlab Simulation FilesMatlab Simulation Files(Matlab Simulation Files)
- 2013-08-03 10:43:19下载
- 积分：1
-
gabor_Sample
使用Matlab編寫的Gabor Filter範例程式(Matlab Gabor Filter Sample)
- 2011-11-14 14:42:16下载
- 积分：1
-
study-ofMatlab7.0
Matlab7官方学习资料，能帮助你很快的学习Matlab的实用，简单、权威(Matlab7 official learning materials that can help you quickly learn Matlab s practical, simple, authoritative)
- 2011-12-29 16:15:39下载
- 积分：1
-
fw
说明： 数字信号处理，滤波，维纳滤波器，维纳—霍夫方程(Digital signal processing, filtering, Wiener filter, Wiener- Hoff equation)
- 2011-11-06 13:01:49下载
- 积分：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
