登录
首页 » matlab » CODE_CS

CODE_CS

于 2013-10-04 发布 文件大小:15KB
0 194
下载积分: 1 下载次数: 3

代码说明:

  CODE FOR CR TFF FOR IMAGE POCESSING

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

发表评论

0 个回复

  • thsign
    threshold signcryption based on ecc
    2009-12-16 06:53:03下载
    积分:1
  • PSO_CESHI
    经典的基本PSO粒子群优化算法的测试函数,包括主程序和测试函数,非常经典(The classic PSO basic particle swarm optimization test functions, including the main program and test functions, very classic)
    2020-11-21 00:29:38下载
    积分:1
  • estimation
    加权最小二乘法状态估计算法程序,可以算不同数量的节点。限制小,程序结构简单,简单易懂,讲解详细。还可以根据需要对目标函数以及残差进行每次迭代的输出。(Weighted least squares state estimation algorithm, can be used for different number of buses. Restrict small, program structure is simple, easy to understand, explain in detail. Also according to the objective function and the output of each iteration residuals.)
    2020-07-26 20:28:42下载
    积分:1
  • matlabexample100
    matlab实例编程一百个源程序,是matlab学习和研究者的很好的参考资料。(matlab example)
    2009-10-16 09:24:28下载
    积分:1
  • LSL
    LSL最小二乘方格型算法的自适应滤波程序及其应用(LSL least-squares grid-based algorithm for adaptive filtering procedures and its application)
    2010-01-04 13:01:16下载
    积分:1
  • lla2ecef
    Convert from latitude, longitude, and altitude (geodetic with respect to the WGS-84 ellipsoid) to a position vector in the Earth-centered, Earth-fixed (ECEF reference frame.
    2013-09-26 23:55:27下载
    积分:1
  • LMS_1D
    LMS predictive 1d matlab code
    2010-07-21 01:24:38下载
    积分:1
  • QPSKAWGN
    无线通信,信号通过qpsk调制,在高斯白噪声环境下的传输(Wireless communications, signal modulation by qpsk, white Gaussian noise environment in the transmission)
    2010-09-14 14:57:50下载
    积分:1
  • Dijkstra
    说明:  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。   Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
    2008-11-26 22:27:45下载
    积分:1
  • ArabicODR
    optical character recognition for Arabic numbers
    2012-05-27 03:36:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载