登录
首页 » matlab » bsp_2_3_ladt2

bsp_2_3_ladt2

于 2010-10-02 发布 文件大小:1KB
0 147
下载积分: 1 下载次数: 14

代码说明:

  LADT ECG Compression Algorithm 2

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

发表评论


0 个回复

  • OFDMwithwindowing
    说明:  加窗信号经过ofdm系统的调制和解调的matlab仿真程序(Window signal through ofdm system modulation and demodulation matlab simulation program)
    2010-04-15 16:03:16下载
    积分:1
  • PI_gps_time_domain
    说明:  gps信号的处理,时域分析 内有gps信号加干扰程序 时域处理方法(gps signal processing, time domain analysis gps signal plus interference within the time-domain processing program)
    2011-04-12 11:14:16下载
    积分:1
  • Learn-SVM-Step-by-Step-by-faruto2011
    matlab实现svm,最简单的实例,一步一步的很清楚(matlab implementation svm, the most simple example, a very clear step by step)
    2013-09-22 10:13:29下载
    积分:1
  • SPXY
    在Matlab函数,X和y是仪器响应矩阵的列向量和参数值,分别为。Ncal是被选中的对象数目。m所选对象中返回的索引向量。(In this Matlab function, X and y are the instrumental response matrix (independent variables) and the column vector of parameter values (dependent variable), respectively. Ncal is the number of objects to be selected for the calibration set. The indexes of the selected objects are returned in vector m)
    2014-12-17 22:37:09下载
    积分:1
  • 完整模拟地震正演的
    一个完整模拟地震正演的程序,能够正常运行,完美显示了地震波剖面图。(seismic forward modeling)
    2015-11-17 22:28:20下载
    积分:1
  • 013362822yuanzhen
    对均匀圆阵和均匀线阵的方向图指向进行描述 matlab(UCA ULA MATLAB)
    2010-11-30 10:11:43下载
    积分:1
  • kmeans
    K-means is a clustering algorithm In the beginning we determine number of cluster K and we assume the centroid or center of these clusters. We can take any random objects as the initial centroids or the first K objects in sequence can also serve as the initial centroids. There are two function for that the kMeanCluster and distMatrix
    2010-03-10 13:41:13下载
    积分:1
  • licence-recognition
    anpr code detailed segmentation of license plate njy
    2012-04-13 02:19:26下载
    积分:1
  • TSP(TravelingSalesmanProblem)
    Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
    2007-11-15 01:44:52下载
    积分:1
  • Chapter_4
    Matlab files of chapter 4 kalman filtering 3 edition of grewal
    2009-06-12 17:48:35下载
    积分:1
  • 696518资源总数
  • 104752会员总数
  • 9今日下载