登录
首页 » matlab » bbbbbbbbbbbbbb

bbbbbbbbbbbbbb

于 2010-08-15 发布 文件大小:279KB
0 133
下载积分: 1 下载次数: 1

代码说明:

  the useful information for project guide.Here is matlab pdf

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

发表评论

0 个回复

  • ChaosToolbox2p9_trial
    混沌分析工具箱,里面有很多有用的软件。希望对大家有帮助(Chaotic Analysis Toolbox)
    2013-08-29 17:04:05下载
    积分:1
  • Big-Data-Integreation-Theory--Book
    Big Data Integration Theory Zoran Majkić Theory and Methods of Database Mappings, Programming Languages, and Semantics
    2015-01-20 12:20:45下载
    积分:1
  • jpeg2000gui
    image compression jpeg 2000
    2010-08-11 17:16:49下载
    积分:1
  • Dijkstra
    图与网络论中求最短路径的Dijkstra算法(Graph and network theory for the Dijkstra shortest path algorithm)
    2008-07-27 12:24:39下载
    积分:1
  • SVD
    prony method is provide for every one use it
    2012-10-09 22:13:34下载
    积分:1
  • algorithm_k
    It is a small part of code that used for clustering approach
    2015-03-18 15:48:22下载
    积分:1
  • GA
    说明:  遗传算法,分为个7个子函数:分别为编码、解码、选择、交叉、变异、目标函数和总调用。有详细的注释。(Genetic algorithm, into a seven sub-functions: respectively, encoding, decoding, selection, crossover and mutation, the objective function and the total calls. There are detailed notes.)
    2011-10-15 23:53:01下载
    积分:1
  • OFDM-System
    OFDM System, including pilot, GI, Guard band, rayleigh channel, AWGN, equalization, channel estimation.
    2014-02-20 03:08:38下载
    积分:1
  • LlOUCAS
    In computer vision, the Lucas–Kanade method is a widely used differential method for optical flow estimation developed by Bruce D. Lucas and Takeo Kanade. It assumes that the flow is essentially constant in a local neighbourhood of the pixel under consideration, and solves the basic optical flow equations for all the pixels in that neighbourhood, by the least squares criterion.
    2010-12-14 17:03:03下载
    积分:1
  • MATLAB
    here is a program MATLAB for maximum smallest, Tiệ m có thể
    2013-08-10 14:10:29下载
    积分:1
  • 696518资源总数
  • 104509会员总数
  • 10今日下载