登录
首页 » 算法 » The lingo of learning courseware, very good thing to use.

The lingo of learning courseware, very good thing to use.

于 2023-01-29 发布 文件大小:2.12 MB
0 142
下载积分: 2 下载次数: 1

代码说明:

有关lingo的学习课件,很好用的东西。-The lingo of learning courseware, very good thing to use.

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

发表评论

0 个回复

  • mp3编码解码实现,硕士论文
    好好学习,天天向上,但愿能够帮到你们。这里是mp3编解码算法,及其一些原理图。很详细的,你一定好好研究,才能明白的哦。
    2022-07-12 00:11:49下载
    积分:1
  • vc preparation procedures calculated pi
    vc编写 计算圆周率程序-vc preparation procedures calculated pi
    2022-01-23 11:08:28下载
    积分:1
  • 一般的快速DCT只有8点和16点的,我这里提供任意长度(2的幂次方)的DCT快速原代码...
    一般的快速DCT算法只有8点和16点的,我这里提供任意长度(2的幂次方)的DCT快速算法原代码-general fast DCT algorithm only 8:00 and 16:00, and here I am of arbitrary length (two of the power law) DCT fast algorithm source code
    2023-08-08 07:40:03下载
    积分:1
  • 3维FDTD
    3维FDTD算法-arithmetic for three dimensional FDTD
    2023-02-28 19:55:03下载
    积分:1
  • Cholesky分解方
    #包括;
    2022-07-18 10:10:42下载
    积分:1
  • 如何在weka中加入自己的,对于增加新的以开发自己的数据挖掘工具。很有用...
    如何在weka中加入自己的算法,对于增加新的算法以开发自己的数据挖掘工具。很有用-How to weka add their own algorithms, for adding new algorithms to develop their own data mining tools. Useful
    2023-01-08 10:40:03下载
    积分:1
  • 分支定界的0/1背包问题
    分支定界的0/1背包问题-branch delimitation of the 0/1 knapsack problem
    2022-02-14 20:11:44下载
    积分:1
  • / = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = /功能annot
    //=== === === === === === === = //函数说明 //函数名称:PolyFit //函数功能:最小二乘法曲线拟合 //使用方法:double *x ---- 存放n个数据点的X坐标 // double *y ---- 存放n个数据点的Y坐标 // int n -------- 给定数据点个数 // double *a ---- 返回m-1次拟合多项式的m个系数 // int m -------- 拟合多项式的项数,即拟合多项式的最高次为m-1。要求m20,则本函数自动按m=min{n,20}处理 // double *dt --- dt[0]返回拟合多项式与各数据点误差的平方和;dt[1]返回拟合多 // 项式与各数据点的误差绝对值之和;dt[2]返回拟合多项式与各数据 // 点误差绝对值的最大值 //注意事项:拟合多项式的形式为 y = b0 + b1*(x-Xavr)... -//=== === === === === ==== === === === === === === ==== === =// function annotations// function name : PolyFit// Function functions : Least Squares Curve Fitting// Use : double* x n-store data point coordinates of the X//* y double-storage n data point Y coordinates// int n-------- given the number of data points//* a double---- returned to the m-1 m fit polynomial coefficients// int m-------- polynomial fitting items , which is the highest polynomial fitting time for m-1. Request m
    2023-07-25 11:15:03下载
    积分:1
  • 这是用C编写的贪婪,非常实用,欢迎大家下载哈!
    这是用C编写的贪婪算法,非常实用,欢迎大家下载哈!-This is prepared by using C greedy algorithm is very practical, welcomed everyone to download Ha!
    2022-03-25 10:51:26下载
    积分:1
  • 点可配置FFT的源代码,注释详细
    点可以配置fft算法的源代码,注释,细节
    2023-04-19 04:05:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载