登录
首页 » matlab » temporal_activity

temporal_activity

于 2011-05-26 发布 文件大小:1KB
0 252
下载积分: 1 下载次数: 2

代码说明:

  Matlab source code to calculate temporal activity.

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

发表评论

0 个回复

  • kalman
    进一步加深对卡尔曼滤波算法的理解,了解卡尔曼滤波器算法的基本特点,掌握卡尔曼滤波算法应用研究的基本步骤和方法(Kalman filter algorithm to further deepen the understanding and knowledge of the basic characteristics of the Kalman filter algorithm, Kalman filter algorithm is applied to master the basic steps and methods of research)
    2011-05-10 16:31:38下载
    积分:1
  • magicwand1
    这是模拟photoshop中魔术棒效果的matlab程序,用于图像分割(This is the simulation of Photoshop magic wand effect of Matlab procedures for image segmentation)
    2007-05-11 09:18:25下载
    积分:1
  • viterbi_path
    hidden markov viterbi
    2011-07-28 13:43:53下载
    积分:1
  • viterbi-decoding
    维特比译码算法的实现,以及卷积码译码的误码率性能分析(Viterbi decoding algorithm, as well as the BER performance of the convolutional code decoding)
    2012-06-11 15:54:42下载
    积分:1
  • harmaSyllableSeg
    a program to segmentation of syllable in speech processing
    2011-09-01 02:18:03下载
    积分:1
  • DE-差分进化算法
    差分进化算法的pdf和完整代码,差分进化算法包括变异、交叉和选择三大操作(Differential Evolution Algorithm PDF and complete code, differential evolution algorithm includes mutation, crossover and selection of three major operations)
    2020-11-06 08:59:50下载
    积分:1
  • GA1
    基本遗传算法的代码,基于精英保留策略的二进制遗传算法(Binary genetic algorithm based on elite retention strategy)
    2020-06-28 20:40:02下载
    积分:1
  • Matlab_and_VC
    vc 和 matlab 混合编程例程,已通过测试(vc and matlab mixed programming routines, has been tested)
    2007-09-16 10:38:04下载
    积分:1
  • ma3alm
    rake reciver simulation in matlab
    2009-12-25 22:29:41下载
    积分:1
  • Minimum-Cost-Flow
    最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下,此类问题的研究试图寻找出:流量从A到B,如何选择路径、分配经过路径的流量,可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)
    2013-08-23 23:10:20下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载