登录
首页 » matlab » Matlab-userguide

Matlab-userguide

于 2012-11-22 发布 文件大小:12498KB
0 270
下载积分: 1 下载次数: 2

代码说明:

  this is for the fresher to use the matlab

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

发表评论

0 个回复

  • beamforming_jiaocheng
    matlab关于自适应波束形成以及阵列信号处理的程序教程,适合初学者(for beginners about array signal processing)
    2012-04-21 20:38:10下载
    积分:1
  • Radarsimulink
    一个雷达系统的模拟程序!比较逼真的展示雷达的工作过程1(A radar system simulation program! Realistic comparison of the working process of the radar display 1)
    2009-01-04 19:44:10下载
    积分:1
  • matlab_netcdf_5_0
    读取Network Common Data Form (netCDF)数据(Read Network Common Data Form (netCDF) data)
    2008-07-12 02:26:53下载
    积分:1
  • PF-error
    基于粒子滤波器的目标跟踪算法。适合刚开始学习目标跟踪和粒子滤波器的人员。(Particle filter based tracking algorithm. Learning objectives for the beginning of the personnel tracking and particle filters.)
    2011-05-12 16:24:19下载
    积分:1
  • code
    Simple code for Spectral analysis of speech signal.
    2015-01-31 01:33:20下载
    积分:1
  • TreeSet
    Keys are this set s elements. Values are always Boolean.TRUE.
    2014-02-21 13:10:07下载
    积分:1
  • AmultiKalmanfilteringapproachforvideotrackingofhum
    A multi-Kalman filtering approach for video tracking of human-delineated objects in cluttered environments is an latest PH.D graduation paper! it give to most needing people.(A multi-Kalman filtering approach for vid eo tracking of human-delineated objects in clu ttered environments is an latest PH.D. graduati on paper! it give needing to most people.)
    2007-03-10 17:12:27下载
    积分:1
  • mp3Read
    通过该开发包,matlab可以读取MP3数据(Through the development kit, matlab can read MP3 data)
    2015-01-13 10:36:47下载
    积分:1
  • PCA
    用主成分分析法估计出点云中每点的法向量函数(Principal component analysis method for normal estimation in point cloud )
    2020-07-31 16:28:37下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载