登录
首页 » matlab » tarea7problema2

tarea7problema2

于 2010-12-17 发布 文件大小:1KB
0 169
下载积分: 1 下载次数: 1

代码说明:

  This paper is a compilation of the book s problems Mitra digital signal processing 3 ed second work

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

发表评论

0 个回复

  • routing_T
    在BA无标度网络中求平均传递时间算法的matlab原程序。用该算法可以计算出网络拥塞的临界点。 (In the BA scale-free network in order to pass the time on average algorithm matlab original procedure. The algorithm can be used to calculate the critical point of network congestion.)
    2007-09-17 14:57:54下载
    积分:1
  • ofdm_matlab
    OFDM仿真的一个好资料,涉及DVB的发射标准仿真,以及几个开放的接收方法仿真!(OFDM simulation using matlab)
    2010-11-06 15:04:13下载
    积分:1
  • ex_circlepoint2
    批量处理灰度图像,并能够识别图像质量中心进行截圆处理,同时生成灰度直方图以及各个点的坐标文件(Batch processing grayscale images, the image quality and the ability to identify the center circle cut deal, while generating histogram and the coordinates of each point file)
    2013-12-12 20:37:30下载
    积分:1
  • Haar-likeMatlab
    矩形遍历检测窗口演示Matlab源代码,用于理解Haar-like的功能(Haar-like rectangular detection window traversal demo Matlab source code for understanding Haar-like functions)
    2013-11-27 09:49:13下载
    积分:1
  • BAb--02-Deret-Taylor-dan-Analisis-Galat
    Deret Taylor dan Analisis Galat
    2014-09-08 00:04:02下载
    积分:1
  • DI-S-AND-V
    这个程序是为了区分SIGNAL和VARIABLE在不同情况下要怎样使用的例程,程序中使用了三种情况来说明问题(This program is designed to differentiate between routine SIGNAL VARIABLE in different situations and how you want to use, the program uses the three cases to illustrate the problem )
    2015-01-12 12:56:26下载
    积分:1
  • calculator
    一个基于的MATLAB的计算器GUI例程,适合初学者学习。(Based on MATLAB the calculator GUI routines, suitable for beginners to learn.)
    2012-11-22 19:37:54下载
    积分:1
  • rls_lip_mlp
    rls神经网络模型在matlab中的程序实现(rls neural network model in matlab program to achieve)
    2014-02-25 16:48:24下载
    积分:1
  • Higuchi算法分形
    分形维数研究声发射时间序列上的撞击率的higuchi维数(Fractal dimension study on the Higuchi dimension of the impact rate in acoustic emission time series)
    2021-04-22 09:48:48下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696518资源总数
  • 105547会员总数
  • 4今日下载