登录
首页 » matlab » Mat

Mat

于 2012-05-28 发布 文件大小:1274KB
0 196
下载积分: 1 下载次数: 13

代码说明:

  face recognition with pca-lda and orl database

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DOA
    空间谱估计 经典music算法 2个例子(DOA MUSIC)
    2010-07-02 15:37:31下载
    积分:1
  • im2mov
    convert directory of images to a movie in Matlab
    2013-10-30 03:41:24下载
    积分:1
  • F16_fuzzy_theta
    F16战斗机的飞行模糊控制器,在matlab环境下simulink中进行仿真(FUZZY CONTROL FOR F16 FIGHTER)
    2020-07-03 14:20:01下载
    积分:1
  • Kalman_matlab_example
    卡尔曼滤波程序,并附有具体的实例,对初学者希望有用(Kalman filtering process, together with specific examples, hope helpful for beginners)
    2010-05-06 12:54:20下载
    积分:1
  • 200951482GAyh
    使用matlab求解一元函数最大值问题的代码(Solving functions of one variable maximum )
    2011-07-08 23:48:29下载
    积分:1
  • Convertor
    Signal Convertor for converting ECG signal,
    2012-07-20 01:26:31下载
    积分:1
  • VnmoFromVstrata
    用于将层速度转化为动校正速度,使用在地震勘探研究中。(Computing the Vnmo from Vstrata for horizontal strata in seismic research.)
    2013-09-25 20:29:10下载
    积分:1
  • matlabGUItomake
    它是matlabgui函数界面说明it is matlab of gui function (it is matlab of gui function )
    2009-06-03 21:23:48下载
    积分:1
  • FUNCTION
    matlab中所有基本函数功能实现的源代码,可以利用以下函数实现matlab中信号处理的傅里叶等函数变换。(matlab function to achieve the basic function of all the source code, you can use the following function implementation matlab signal processing functions such as Fourier transform.)
    2010-12-23 00:12:09下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • 696516资源总数
  • 106562会员总数
  • 4今日下载