登录
首页 » 算法 » C++写的DTMF算法

C++写的DTMF算法

于 2022-03-17 发布 文件大小:71.46 kB
0 126
下载积分: 2 下载次数: 1

代码说明:

C++写的DTMF算法C++写的DTMF算法C++写的DTMF算法

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

发表评论

0 个回复

  • 逆波兰表达式求值
    是自己写的逆波兰表达式求值问题  通过栈和数组来存储数据完美实现了计算过程..
    2023-07-09 11:00:03下载
    积分:1
  • Implements Minimum Search Tree using Kruskal Algorithm
    Implements Minimum Search Tree using Kruskal Algorithm
    2022-01-23 10:06:31下载
    积分:1
  • 包括基本概念,数学规划的分析方,B。
    包括基本概念,数学规划的解析法,基本构件优化设计,线性规划,桁架优化设计,连续梁和钢架的优化设计,非线性规划在结构优化设计中的应用,动态规划,几何规划,结构动力优化-Including basic concepts, the analytic method of mathematical programming, the basic components to optimize the design, linear programming, optimization of truss design, steel beams and continuous optimization of the design, non-linear programming in structural optimization and design, dynamic programming, geometric programming, structural dynamics Optimization
    2022-08-13 22:32:11下载
    积分:1
  • 非常简便,代码短且稳健性强
    非常简便,代码短且稳健性强-very simple, but short code stability-
    2022-04-26 08:45:45下载
    积分:1
  • Delaunay 剖分源代码
    根据用户输入的二维点(x,y)进行Delaunay三角剖分,主要采用的是种子生长算法来剖分平面的,是计算机图形学当中主要的曲面造型的剖分算法实现。
    2022-03-20 09:16:12下载
    积分:1
  • 用幂求矩阵的按模最大的特征值,是数值分析里的经典方...
    用幂法求矩阵的按模最大的特征值,是数值分析里的经典方法-method for using the power of the matrix model by the largest eigenvalue of numerical analysis of the classical method
    2022-08-17 05:05:25下载
    积分:1
  • the codes and solution for zoj 2210
    zoj 2210的代码和方法说明,个人原创 -the codes and solution for zoj 2210
    2022-03-21 00:59:08下载
    积分:1
  • TMVA 数据处理包
    System requirements:--------------------  TMVA has been tested to run on Linux, MAC/OSX and Windows platforms.  Running TMVA requires the availability of ROOT shared libraries with ROOT_VERSION >= 5.14  (type "root-config --version" to see the version installed)来源URL里面有代码的详细资料http://tmva.sourceforge.net/docu/TMVAUsersGuide.pdfUSERguide可以在上面的链接下载 非常有用 TMVA是ROOT工程的一个独立package, 专门用于数据分析和识别ROOT的全部代码可以在下面的链接下载http://root.cern.ch/drupal/   
    2022-12-12 12:15:04下载
    积分:1
  • FLCS在3DIC設計中會使用的方
    在3DIC設計中會使用的方法  Floorplanning is an important and dispensable stage in the traditional integrated circuit design process. With the raised module numbers and increased wire length, the computation complexity is raised dramatically. Obviously, the traditional algorithms need to be updated. We developed an orthogonal table, in which each factor represents a module and the level of a specified factor denotes the orientation of that module. With this orthogonal table, the solution space is significantly decreased.  We use sequence pair to represent a floorplan and the fast longest common subsequence is used accordingly to calculate the area of
    2022-08-13 12:52:54下载
    积分:1
  • cholesky,解三对角矩阵的
    cholesky算法,解三对角矩阵的-cholesky algorithm, and three diagonal matrix
    2022-10-06 10:05:03下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载