登录
首页 » Visual C++ » XDBM

XDBM

于 2010-04-10 发布 文件大小:61KB
0 482
下载积分: 1 下载次数: 0

代码说明:

说明:  信道编码用于计算信道的容量,计算起来比较简单迅速。(Channel coding is used to calculate the channel capacity, calculate simple fast.)

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

发表评论

0 个回复

  • 20081004
    GMM 混合高斯自适应背景维护 可以用来做行人检测 等(GMM Gaussian Mixture adaptive background maintenance can be used to make the pedestrian detection)
    2008-05-23 15:02:18下载
    积分:1
  • 121
    功能:输入一页文字,程序可以统计出文字、数字、空格的个数功能:输入一页文字,程序可以统计出文字、数字、空格的个数(code)
    2009-12-24 11:19:30下载
    积分:1
  • BPA
    本人编写的BPAmatlab程序,用于神经网络学习。(I prepared BPAmatlab procedures for neural network learning.)
    2013-10-25 21:19:47下载
    积分:1
  • 3D
    说明:  2014-An Analysis and Implementation of a Parallel Ball Pivoting Algorithm 图像3D算法 含源码(2014-An Analysis and Implementation of a Parallel Ball Pivoting Algorithm)
    2014-09-02 19:03:08下载
    积分:1
  • Super-Trend-Profit
    Ea forex, um bom robot
    2015-03-25 04:16:11下载
    积分:1
  • Bifurcation_coexist_attractors
    在多吸引子的情况下, 求解系统完整的分岔图(more attractors in the case, a complete system for the bifurcation plan)
    2007-06-15 18:52:53下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • code
    數學function的用法 這個使用的方法對於數學界很重要 提供function使得 很多人不用在自己寫的很痛苦(ceiling method)
    2010-01-18 16:15:12下载
    积分:1
  • blackholeaodv.cc.tar
    FILE SHOWS THE MODIFICATIONS FOR AODV.CC FOR INTRODUCING BLACKHOLE ATTACKS
    2014-01-31 13:41:53下载
    积分:1
  • com
    利用COM组建的实现VC++与MATLAB的混合编程(COM realize the use of established VC++ Mixed with MATLAB Programming)
    2008-05-07 13:21:55下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载