登录
首页 » matlab » 1111

1111

于 2010-04-28 发布 文件大小:2KB
0 100
下载积分: 1 下载次数: 0

代码说明:

说明:  lbg算法的实现,应用平台MATLAB.DAJIA DJFAIUDF(lbg algorithm, application platform MATLAB.DAJIA DJFAIUDF)

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

发表评论

0 个回复

  • fessler
    用于非均匀采样数据的快速傅里叶变换,相比重采样算法具有更高的精度(for the fast fourier transform of non-equalspace sampled data)
    2020-12-02 21:49:27下载
    积分:1
  • KMedoids
    聚类K-Medoids算法。文件里面包含了详细的程序说明和示例。(K-Medoids clustering algorithm.The file contains a detailed description of the procedures and examples.)
    2009-09-07 23:14:50下载
    积分:1
  • pid0001
    说明:  matlab比例积分微分调节器仿真程序 系数整定(matlab PID adaptive controller)
    2011-02-27 06:59:39下载
    积分:1
  • aa
    说明:  地震真振幅成像,以及射线追踪技术,外文文章,内容非常详尽(seismic true-amplitude imaging, and seismic ray tracing )
    2011-03-30 19:49:52下载
    积分:1
  • sldemo_antiwindup
    Explores the anti-windup capabilities supported by the PID Controller block in Simulink.
    2013-07-31 20:29:01下载
    积分:1
  • Final_RPS
    Here different algorithms which are suitable for watermarking are implemented and MATLAB results are shown for reference.
    2011-10-20 18:13:15下载
    积分:1
  • shapecontext
    shape context matlab 实现(shape context matlab code)
    2012-09-08 20:24:59下载
    积分:1
  • menjen
    对信号进行频谱分析及滤波,完整的基于HMM的语音识别系统,雅克比迭代求解线性方程组课设。( The signal spectral analysis and filtering, Complete HMM-based speech recognition system, Jacobi iteration for solving linear equations class-based.)
    2016-09-09 15:07:45下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • detect
    matlab编写的,检测编码是否为唯一可译码的小程序,仅供参考(matlab prepared to detect whether encoding decoding only a small procedure, for reference only)
    2020-12-12 16:29:16下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载