登录
首页 » matlab » balloon

balloon

于 2013-05-11 发布 文件大小:2KB
0 241
下载积分: 1 下载次数: 2

代码说明:

  balloon model of hemodynamic

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

发表评论

0 个回复

  • histo
    二维图像直方图的绘制程序,基于MATLAB(Two-dimensional image histogram mapping procedures, based on MATLAB)
    2008-01-24 16:45:56下载
    积分:1
  • k1
    说明:  clustering the data for data mining
    2009-05-05 13:56:38下载
    积分:1
  • Delphi-and-Matlab
    Delphi与Matlab混合编程,在Delphi中调用Matlab文件(Delphi and Matlab. Matlab files being called in Delphi)
    2013-10-19 19:33:52下载
    积分:1
  • boxcount
    Fractal dimension using the box-counting method for 1D, 2D and 3D sets
    2007-11-22 11:36:17下载
    积分:1
  • jiauqanpingjunfenjisuanchengxu
    该程序可应用于普通高校的综合测评的加权平均成绩的计算,可以查看奖励绩点,内含详细的操作说明。(The program can be used to calculate a comprehensive evaluation of the weighted average college grades, you can view the award Grade Point Average, containing detailed instructions.)
    2014-09-30 18:20:20下载
    积分:1
  • filtering
    高通滤波器 低通滤波器 数字滤波器 语句较短 (High-pass filter low pass filter digital filter shorter sentence)
    2014-11-25 18:36:39下载
    积分:1
  • principleofdcommunication
    本书使用MATLAB的基本语法莱实现算法,避免将所要实现的功能隐藏在函数之下,而让读者不知道是如何实现的。非常适合在校学习通信专业的本科生、研究生作为辅导资料。(This book to use MATLAB)
    2007-10-30 10:55:36下载
    积分:1
  • matlab_vrp
    蚁群算法解决vrp问题的matlab实现 网上这个的代码比较少(Ant colony algorithm to solve the vrp problems matlab online code less)
    2013-04-16 21:09:40下载
    积分:1
  • OFDMIMAGETX_m
    IMAGE transmission in OFDM system with SNR
    2015-03-10 13:12:35下载
    积分:1
  • KNN
    K最邻近密度估计技术是一种分类方法,不是聚类方法。 不是最优方法,实践中比较流行。 通俗但不一定易懂的规则是: 1.计算待分类数据和不同类中每一个数据的距离(欧氏或马氏)。 2.选出最小的前K数据个距离,这里用到选择排序法。 3.对比这前K个距离,找出K个数据中包含最多的是那个类的数据,即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
    2020-10-23 14:37:22下载
    积分:1
  • 696518资源总数
  • 106245会员总数
  • 18今日下载