登录
首页 » Visual C++ » Projects

Projects

于 2014-10-02 发布 文件大小:13709KB
0 132
下载积分: 1 下载次数: 1

代码说明:

  Linear selection algorithm, similar to sequencing, the analysis algorithm to learn to be aware of

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

发表评论

0 个回复

  • DAGUIMO-MIMO
    一个大规模的MIMO仿真平台开发程序,MATLAB仿真(A large-scale MIMO simulation platform development process, MATLAB simulation)
    2020-12-11 18:29:17下载
    积分:1
  • The-FDTD-Method---Computation-and-Analysis
    fdtd program,using the matlab program ,very good
    2012-05-28 17:15:36下载
    积分:1
  • GetEcgPpg
    心电信号处理,滤波与计算 之:数据的读取(ECG signal processing, filtering and calculation of: reading data)
    2014-09-10 19:53:11下载
    积分:1
  • BhoNew_src(2)
    this project is safe browsing project with BHO in IE
    2014-09-20 22:14:11下载
    积分:1
  • raoguosuoyouyonghudecengHOOK
    A、分析API函数原理 B、自写API函数 C、SYSENTER指令 D、硬编码_emit E、模拟FindWindow函数 (Analysis of A, API function principle B, write API function C, SYSENTER instruction D, hard coded _emit E, simulating FindWindow function )
    2014-01-03 06:25:48下载
    积分:1
  • 2DMaxima
    在二维空间里有两个点A=(X1,Y1)和B=(X2,Y2),如果X1>X2并且Y1>Y2 ,我们认为A优于B,A是这个集合的最大极值点,在给定的二维空间里的N个点的集合S中,找出最大极值点。(In two-dimensional space, there are two points = A = (X1, Y1) and B (X2, Y2), if the X1 and Y1 > X2 > Y2, we think that A is superior to B, A is the biggest extreme value point of the set, in A given set of N points in the two-dimensional space S, find out the most extreme value point.)
    2013-12-24 21:02:56下载
    积分:1
  • sysidjob3
    该程序初步实现了M序列的生成,并且详细地进行了频域法的系统辨识分析。(The program is the initial realization of the M-sequence generation, and detail the frequency domain method of system identification analysis.)
    2012-06-09 17:18:09下载
    积分:1
  • matcomVCmixed-programming
    讲述MATLAB与VC混合编程的一篇文章(About the mixed programming MATLAB and VC article)
    2011-12-06 19:26:29下载
    积分:1
  • mixGaussEm
    matlab m文件 EM算法混合高斯模型(matlab m file EM algorithm Gaussian mixture model)
    2015-04-07 06:29:10下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • 696524资源总数
  • 103945会员总数
  • 46今日下载