-
dataacquire
通过matlab软件实现数据的从声卡采集(sound accquire)
- 2009-06-07 10:00:03下载
- 积分：1
-
zishiyinglvbo
matlab自适应滤波器实现。性能比较：估计值与真实值之差
(matlab adaptive filter implementation. Performance comparison: estimated value and the true value of the difference)
- 2013-07-11 20:19:18下载
- 积分：1
-
exm09732_2
对matlab初学者很有帮助，尤其是simulink的爱好者。(helpful to beginners Matlab, Simulink is particularly fond.)
- 2007-05-08 16:04:59下载
- 积分：1
-
knn_demo
K近邻法的matlab程序，发现大家都在找它！(K-nearest neighbor method of Matlab procedures, I found that we all have to find it!)
- 2007-05-24 21:13:16下载
- 积分：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
-
MATLAB_sparse_matrix_and_variable_tutorial
MATLAB稀疏矩阵和变量教程MATLAB sparse matrix and variable tutorial(MATLAB sparse matrix and variable tutorial MATLAB sparse matrix and variable tutorial)
- 2010-08-03 10:13:04下载
- 积分：1
-
d2gauss
function to calculate gaussian filter
- 2010-08-22 02:48:21下载
- 积分：1
-
Question1
说明： C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？
要求：输入K，n，a1，a2......an
输出：他能最多带出的宝物价值
(C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
- 2008-12-02 21:07:25下载
- 积分：1
-
disyiwei
离散序列的移位运算,不知道能不能适用于CDMA扩频码时延的移位(discrete sequence of shift operations do not know can apply to delay CDMA code of shift)
- 2007-06-14 19:25:41下载
- 积分：1
-
Cal_IniAtti_level
在惯性导航系统导航结算过程中对初始姿态的初始化设定。(Initial posture in the settlement process of the inertial navigation system navigation initialization settings.)
- 2012-11-05 20:11:08下载
- 积分：1
