-
MATLAB
大时代奥维德单位啊打完爱的阿斯顿我饿人大的(dasdasdaweqdasd)
- 2009-03-06 18:13:14下载
- 积分：1
-
Denoising
it is a matlab software we have to plan to implement it
- 2009-12-14 18:45:57下载
- 积分：1
-
hankel_var1
本函数计算hankel函数一致展开中的变量(This function calculation hankel function unanimously expand the variable)
- 2012-05-21 16:15:42下载
- 积分：1
-
matlab-image-processing
MATLAB数字图像处理书籍\matlab图像处理操作程序(matlab image processing procedures)
- 2014-10-24 18:06:48下载
- 积分：1
-
optimize
最速下降法和牛顿法解决最优化问题
dampnm.m - 牛顿法
grad.m - 最速下降法(The steepest descent method and Newton' s method to solve optimization problems dampnm.m- Newton grad.m- the steepest descent method)
- 2013-09-20 17:09:12下载
- 积分：1
-
matlab
matlab的追赶法，追赶法是适用于三对角矩阵的线性方程组求解的方法，并不适用于其他类型矩阵，及matlab的gauss求解方程方法，牛顿插值法，拉格朗日插值法。(matlab chasing method chasing method is applicable to the tridiagonal matrix method for solving linear equations, does not apply to other types of matrix and matlab gauss solving equations method, Newton interpolation, Lagrange interpolation.)
- 2013-04-13 09:12:24下载
- 积分：1
-
Delta-Modulation
Line Modulation in matlab
- 2011-11-26 04:07:45下载
- 积分：1
-
LOC
loc pss source code with sample parametr
- 2012-09-29 23:33:42下载
- 积分：1
-
StereovisionReconstruction
Stereovision reconstruction using Triangulation and "Mire" Calibration.
Implemented in Matlab language
- 2009-05-27 12:38:53下载
- 积分：1
-
combine---two-binary-trees-
This is a small program to create indexs for two binary trees and combine them to a new
003
* index tree and output the new tree,the second tree only has the left child tree then
004
* if the first tree has no left child tree,insert the second tree into the first tree as
005
* its left child and if the first tree has the left child tree,then insert the first tree
006
* into the second tree as its left child.
(This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)
- 2012-06-11 16:16:55下载
- 积分：1
