登录
首页 » matlab » EM

EM

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

代码说明:

说明:  求解参数估计的常用算法——EM,即期望最大化算法,用于代替样本量不完全时的极大似然估计算法。(Common algorithm for solving parameter estimation- EM, expectation maximization algorithm is used to replace the sample size is not completely at the maximum likelihood estimation algorithm.)

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

发表评论

0 个回复

  • 3MATLABdesign
    数字滤波器设计文档(自己作设计时用的ppt)(Digital Filter Design Documents (for their design of ppt))
    2007-05-09 21:26:22下载
    积分:1
  • FIRdesign
    MATLAB code for FIR filter design
    2009-11-26 16:23:09下载
    积分:1
  • CORE_v0p7
    HI THERE AM HERE HOW ARE YOU DOING
    2013-11-11 11:26:30下载
    积分:1
  • Romberg
    通过输入区间端点a和b以及精度,初始等分数和最大外推层数来近似f(x)在a到b上的积分!(By entering a and b as well as the interval endpoint accuracy, the initial fraction and the like to approximate the maximum number of layers extrapolation f (x) at the points a to the b!)
    2014-11-29 20:15:20下载
    积分:1
  • signal
    这个程序的主要内容是基于matlab对于语音信号的增强(The main content of this program is based matlab for speech enhancement)
    2013-04-04 16:30:44下载
    积分:1
  • digit
    Basic hopfield neural network exaple. Digit
    2015-03-20 18:34:26下载
    积分:1
  • Engineering-Optics-With-Matlab
    Ting-Chung Poon, Taegeun Kim著,《工程光学的matlab编程》 2006年世界科学出版社(Ting-Chung Poon, Taegeun Kim (Author)- Engineering Optics With Matlab (World Scientific,2006))
    2013-04-02 09:49:36下载
    积分:1
  • lab_261
    Add for matlab.Can do orienting plus shraping.
    2010-06-19 06:25:52下载
    积分:1
  • viterbi_decoder
    说明:  这是一个针对卷积码的维特比译码器.开发环境为MATLAB(This is a viterbi_decoder which can decode convolution codes.)
    2009-08-07 10:35:52下载
    积分:1
  • SIMULATED-ANNEALING-
    这是一个关于商人visit许多城市,怎样走法才能使距离最短的例子,采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given a numberof cities to v d their distances from all other cities know, an optimal travel route has to und so that each city is visited one and only once with the least possible dista aveled. This is a simple problem with handful of cities but becomes complica the number increases.)
    2013-12-15 03:26:30下载
    积分:1
  • 696522资源总数
  • 104033会员总数
  • 52今日下载