登录
首页 » PPT » OCR

OCR

于 2014-01-27 发布 文件大小:625KB
0 184
下载积分: 1 下载次数: 3

代码说明:

  optical CHARACTER RECOGNITION with important diagrams.

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

发表评论

0 个回复

  • DSP9_MATLAB
    信号处理中的若干典型算法,很不错的,希望对大家游泳(signal processing algorithms typical of a number of very good, we hope to swim)
    2006-12-24 17:07:03下载
    积分:1
  • communication
    在无线信道的理论基础上,分析了Suzuki信道模型的结构原理,介绍了利用正弦波叠加法构成高斯序列,从而建立Suzuki信道数学模型的方法,并通过Matlab软件对其进行了仿真。(In the theory of radio channel based on the analysis of Suzuki channel model structure principle, describes the use of sine wave superposition method constitutes a Gaussian sequence, thereby establishing a channel model Suzuki method, and through its simulation Matlab software.)
    2013-10-31 23:39:00下载
    积分:1
  • mojidazhi
    一个MATLAB程序算例,即求模最大值的程序,相互学习用。(Example of a MATLAB program, that is seeking the maximum modulus of the procedures used to learn from each other.)
    2007-08-25 11:38:05下载
    积分:1
  • dijkstra
    this program shortpathes node using graph for decide short distance in networking
    2009-12-16 09:09:42下载
    积分:1
  • Classi
    to classify shape of image
    2011-07-20 01:32:47下载
    积分:1
  • MATLABLanguage
    此书籍完整归纳了matlab从基础到高级应用的常用源代码,是一本不可多得的学习matlab的电子书籍。(This book summarizes the complete matlab from basic to advanced applications commonly used source code, is a rare study matlab e-books.)
    2013-07-22 17:30:36下载
    积分:1
  • Matlab_zuixiaoerchengfa
      最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:54:17下载
    积分:1
  • johnson
    face detection based SVM
    2011-10-05 07:00:23下载
    积分:1
  • 7.x-Garch-Toolbox
    matlab garch工具包 非常智能(matlab garch kit is very smart)
    2010-03-06 16:47:34下载
    积分:1
  • hex2bin
    Hexa to bin Galileo E1
    2012-10-06 05:35:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载