登录
首页 » PDF » BSS-ppt

BSS-ppt

于 2013-09-08 发布 文件大小:940KB
0 373
下载积分: 1 下载次数: 50

代码说明:

  盲源分离课件,本课件用通俗易懂的语言对盲源分离技术进行了详细的讲解,是一个入门的必备课件,我很受益。分享一下。(Blind source separation courseware, the courseware in plain language for the blind source separation techniques for a detailed explanation, is an essential entry courseware, I benefited. Share.)

文件列表:

盲信号分离技术讲座ppt.ppt,1188352,2013-09-07

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

发表评论

0 个回复

  • fsmzxh
    图像复式,自己调试通过的,与大家交流学习(Image duplex, adopted their own debugging, and to share their learning)
    2009-11-06 12:59:41下载
    积分:1
  • ML_fractal_book1
    大自然的分形几何学(最新修订本),该书是pdg格式图书,对分形几何学习有重要作用(this book is a classical book for study fractal)
    2009-05-14 10:24:44下载
    积分:1
  • deidai
    WXH-斐波那契数列.Koch曲线 动态的Von Koch分形曲线,中点法生成Sierpinski地毯 分形蝴蝶 (WXH-Fibonacci sequence. Koch curve dynamic Von Koch fractal curve, the mid-point method to generate fractal Sierpinski carpet Butterfly)
    2009-05-19 09:23:39下载
    积分:1
  • Embedding_External_Applications_into_Maya_Scripts
    This presentation discusses an alternative method for transferring geometry and animation data from another application to Maya. Instead of using some file format to translate data from one application to another, embed the application directly into Maya.
    2011-07-19 05:38:41下载
    积分:1
  • Fractal Image Compression and Decompression 2
    说明:  Fractal using DCT transform
    2020-06-20 03:20:02下载
    积分:1
  • 第28章 使用DAO操作数据库
    使用DAO操作数据库的例子(DAO use the example database operators)
    2004-11-07 19:41:56下载
    积分:1
  • p_model
    产生一维多重分形,以p-model为原理,所得多重分形时间序列具有已知的多重分形谱和奇异性强度。(product fractals)
    2011-12-18 16:43:30下载
    积分:1
  • blanketGFD
    使用毯子法计算图像的分形维数,编程所参考的文献也放在了压缩包中(Using the blanket method of fractal dimension images, programming the reference literature on the compressed package)
    2011-09-15 09:49:57下载
    积分:1
  • DLA (2)
    这属于絮凝分形成长模拟中的DLA模型,让单个粒子去碰撞总粒子,然后判断是否聚集黏附(Flocculation fractal growth simulation)
    2017-11-27 16:39:24下载
    积分:1
  • Fault-Tree
    求故障树的 1)对偶树; 2)最小割级和最小路集; 3)假定底事件的故障概率已知,求顶事件发生的概率; 4)求底事件的结构重要度、概率重要度和关键重要度。(Seeking Fault Tree 1) dual tree 2) minimum cut level and minimal path sets 3) It is assumed that the end of the event of the failure probability known, find the probability of occurrence of the top event 4) Evaluate the end of the event structure importance, important degree of probability and critical degree.)
    2020-09-26 10:57:46下载
    积分:1
  • 696516资源总数
  • 106571会员总数
  • 2今日下载