登录
首页 » WORD » 22011-d10

22011-d10

于 2014-09-30 发布 文件大小:446KB
0 251
下载积分: 1 下载次数: 3

代码说明:

  new std realesd in the lte newer version to be implemented

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

发表评论

0 个回复

  • CSCS
    说明:  matlab源码,关于压缩感知基本算法的一些应用(matlab source code, the basic algorithm on a number of compressed sensing applications)
    2010-04-08 15:10:29下载
    积分:1
  • gm(1-1)gm(1-n)
    灰色预测gm(1,1),gm(1,n)能有效快速解决灰色预测的处理问题。(gm(1,1),gm(1,n) can sole the problem of GM model easily)
    2014-09-03 15:52:22下载
    积分:1
  • XSkill
    Face Recognition algorithm
    2011-12-06 11:14:11下载
    积分:1
  • anup_project
    This project is on type of techniques used to enhance an image, detection of edges. In this project we have used neighborhood processing for the edge detection using convolution mask. And to increase the contrast of an image, we stretched each component of an rgb image.
    2013-12-12 21:14:14下载
    积分:1
  • splinefit
    matlab code for SPLINEFIT
    2015-02-07 13:38:22下载
    积分:1
  • LabVIEW_and_MATLAB
    电子书,LabVIEW与Matlab混合编程,很好的东东。(E-book, LabVIEW and Matlab mixed programming, good Dongdong.)
    2008-03-25 21:11:16下载
    积分:1
  • kalmanfilter
    说明:  基于matlab语言编写的卡尔曼滤波源程序,需要的请下载。(Matlab-based Kalman filtering languages source code, need download.)
    2008-10-22 22:09:35下载
    积分:1
  • DMI-CODES
    direct matrix inversion algorithm matlab code
    2013-10-11 16:41:06下载
    积分:1
  • FileProtect
    Simple File Protection.
    2014-12-04 10:15:20下载
    积分:1
  • huffman
    霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
    2015-04-04 20:34:08下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载