登录
首页 » matlab » HashM

HashM

于 2009-04-12 发布 文件大小:2KB
0 190
下载积分: 1 下载次数: 39

代码说明:

  用Matlab实现Hash算法下大篇幅文本文件中字符出现的频率的统计!非常精炼!(Hash algorithm used Matlab to achieve great length text file in the frequency character of the statistics! Very refined!)

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

发表评论

0 个回复

  • tragettrack
    一个目标的跟踪滤波算法,其中包括了kalman、cvcaimm等,对初学者有所帮助(the arithmetic of trage track)
    2009-09-18 00:02:24下载
    积分:1
  • diagnostic-with-autocorrelation
    diagnostic with autocorrelation
    2013-12-19 22:33:11下载
    积分:1
  • coil
    simulink model for a energized coil
    2011-11-14 20:16:29下载
    积分:1
  • WD
    说明:  一维信号小波变换滤波器matlab源代码,处理一维信号(One-dimensional wavelet transform matlab source code , one-dimensional signal processing)
    2013-07-21 22:24:35下载
    积分:1
  • WIRELESS-COMMUNICATIONS-WITH-MATLAB
    The aim of this book is to help readers understand the concepts, techniques, and equations appearing in the field of MIMO-OFDM communication, while simulating various techniques used in MIMO-OFDM systems.
    2013-03-12 23:02:25下载
    积分:1
  • X5
    matlab编写的局部轨道不平顺,交点型轨道不平顺的(垂向,水平,方向,轨距不平顺)。(matlab prepared local irregularity, intersection type track irregularity (vertical, horizontal, direction, gauge irregularity).)
    2021-03-16 16:49:21下载
    积分:1
  • FLch6BAeg1
    Bayes辨识程序,系统辨识中应用,比较不错,希望大家能用到(Bayes identification procedures, the application of system identification, comparison is true, I hope everyone can use to)
    2007-11-07 14:42:06下载
    积分:1
  • computational-emt
    computational emt in matlab comsol and fortran
    2015-03-13 22:05:15下载
    积分:1
  • Interfunaware(DCA)inJOINT
    通讯系统仿真interfunaware(DCA) in JOINT system(Communication System Simulation interfunaware (DCA) in JOINT system)
    2007-10-15 04:05:22下载
    积分:1
  • 101259363Desktop
    传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
    2017-07-18 12:05:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载