登录
首页 » matlab » SLEP_package_4.1

SLEP_package_4.1

于 2012-08-08 发布 文件大小:939KB
0 231
下载积分: 1 下载次数: 27

代码说明:

  稀疏性学习的工具包,包含说明文件和工具m文件(Sparse learning toolkit, including documentation and tools m file)

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

发表评论

0 个回复

  • planarfitting_Leastsquare
    平面拟合程序,可进行多点的平面拟合~简便易懂(Plane fitting procedure, the plane can be fitted more easily understood ~)
    2010-09-09 11:16:31下载
    积分:1
  • matlab
    该电子书用于初学者的学习软件开发和应用,使初学者比较快速的学习MATLAB(book for beginners learning software development and application of)
    2010-03-04 17:10:25下载
    积分:1
  • SIFT
    SIFT MATLAB SOURCE CODE
    2014-09-24 13:27:45下载
    积分:1
  • Adaptive_filtering_toolbox_v4
    MATLAB files to implement all Adaptive Filtering Algorithms in the book by Paulo S. R. Diniz, Adaptive Filtering Algorithms and Practical Implementation, Fourth Edition, Springer, New York, 2013. MATLAB files by: Guilherme O. Pinto, Markus V. S. Lima, Wallace A. Martins, Luiz W. P. Biscainho, and Paulo S. R. Diniz.
    2015-04-07 23:13:38下载
    积分:1
  • maingui
    Matlab GUI using UICONTROL Function
    2010-06-30 14:15:47下载
    积分:1
  • 本代码是基于MIMO-OFDM系统下做的信道估计技术的研究
    本代码是基于MIMO-OFDM系统下做的信道估计技术的研究。MIMO,OFDM是4G的核心技术,两者相结合的估计算法也是现在研究的热点。本代码包括几种核心的估计算法并可直接仿真出结果。(The code is based on MIMO-OFDM system channel estimation to do research. MIMO, OFDM is the core of 4G technology, a combination of both the estimation algorithm is now a hot research. The code includes several core estimation algorithm and simulation results directly.)
    2020-06-27 00:40:01下载
    积分:1
  • Phantom-2d-1.txt
    It generates a 2dbreast phantom
    2013-11-17 04:32:09下载
    积分:1
  • bfo
    细菌优化算法程序,通过动态的演示说明细菌优化算法的优化过程,从而反应了该算法的有效性。(Bacteria optimization process, through dynamic optimization algorithm demonstrates that the optimization process of bacteria, which reflects the effectiveness of the algorithm.)
    2010-11-17 12:10:09下载
    积分:1
  • diedai
    说明:  迭代法 matlab 数值计算 jacobi (Numerical jacobi iteration matlab)
    2011-02-27 22:41:17下载
    积分:1
  • tsp-matlab
    The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
    2013-10-22 00:42:51下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载