-
jiance
读取视频，检测并标记白色车辆目标，去除车道线和其他非圆碟形状的结构目标物，最后播放可视化后的视频(It will read the video, detect and mark vehicle targets,then lane and other targets of non-circles shape will be removed, at last,play the video after visualization.)
- 2012-03-27 15:17:11下载
- 积分：1
-
erengydet
高斯信道下能量检测算法，MPSK信号为例(Under Gaussian channel energy detection, MPSK signal, for example)
- 2011-09-20 22:27:40下载
- 积分：1
-
K-SVD
k-svd算法在表情识别方面的实现和实例应用，附有图片和文章。(k-svd algorithm for face recognition on the implementation and application examples, with pictures and articles.)
- 2013-08-21 21:01:52下载
- 积分：1
-
CS_DOA
本程序利用matlab实现利用压缩感知进行波达方向估计(This procedure using matlab to achieve the use of compressed sensing for DOA estimated)
- 2021-05-08 09:10:35下载
- 积分：1
-
toc
A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.
- 2014-09-04 18:56:24下载
- 积分：1
-
Bellman-ford
Program to implement Bellman Ford Algorithm
- 2014-09-20 12:28:48下载
- 积分：1
-
解決VRPTW問題。原碼中的例題為solom C1-1
说明： 使用遗传算法求解带时间窗的车辆路径优化问题(VRPTW-GA Genetic Algorithms for VRPTW Solution, Running, with Description)
- 2019-11-18 15:32:39下载
- 积分：1
-
s_LMS
这个是自适应LMS算法的改进方法，变步长lms算法svslms(This is the method of adaptive LMS algorithm, variable step size lms algorithm related papers)
- 2010-06-10 17:57:23下载
- 积分：1
-
Desktop
rfid室内定位相关。可以对误差分布进行仿真研究。生成分布图(rfid)
- 2010-12-27 16:54:47下载
- 积分：1
-
0
说明： 给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入.
输入:第一行两个正整数n(物品数)和C(容量)
第二行n个正整数n,表示物品价值
第三行n个正整数n,表示物品重量
输出:第一行表示总价值
第二行n个数(0/1),0表示物品不装入,1表示装入
例如,
输入:
5 10
6 3 5 4 6
2 2 6 5 4
输出
15
1 1 0 0 1
(Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
- 2009-07-01 23:07:01下载
- 积分：1
