登录
首页 » Visual C++ » Gaussian-blur-with-CUDA-5

Gaussian-blur-with-CUDA-5

于 2013-10-01 发布 文件大小:19965KB
0 378
下载积分: 1 下载次数: 52

代码说明:

  cuda5 and matlab code for Gaussian filtering and parallel image processing code, we hope to help

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

发表评论

0 个回复

  • EOF
    一个方便实用的进行EOF程序,可对数据分析出相应的模态(and eigenvalues V. The most effecient algorithm proposed by von Storch and Hannostock (1984) is used.)
    2014-11-27 22:55:21下载
    积分:1
  • uniform-circular
    均匀圆阵部分阵元失效情况下的DOA估计方法(Part of uniform circular array element failure in case of DOA Estimation)
    2013-12-26 12:47:54下载
    积分:1
  • ASN1PBERPDER
    asn1编码说明,详细说明了asn1编码格式,以及der编码,ber编码(asn1 encoding instructions detailing asn1 encoding formats and coding der)
    2015-02-06 14:57:39下载
    积分:1
  • C-Kalman
    卡拉曼滤波器的c语言实现!非常好!很可以初学者使用!(Karaman filter c language! Very good!)
    2011-10-21 15:59:29下载
    积分:1
  • chengshigongshuiliangyuce
    matlab程序预测,一个算例,城市供水量的预测(matlab program predicted that a numerical example, the amount of urban water supply forecast)
    2013-04-13 21:16:01下载
    积分:1
  • List
    Listing is a program for sorting algorithms using the heaps sort and binary search sorting.
    2014-11-16 12:33:13下载
    积分:1
  • QPSK
    10mQPSK C++代码 rrc滤波(10mQPSK C++ rrc)
    2013-12-25 10:13:16下载
    积分:1
  • gene
    说明:  主要是基因识别的 matlab程序 一种全新的算法(Gene identification is mainly a new algorithm matlab program)
    2011-04-11 20:42:14下载
    积分:1
  • queueing-theory
    洗车模型,经典排队论,关于排队模型的相应说明含在压缩文件之中(Wash model, classical queuing theory, queuing models regarding the appropriate instructions included in the compressed file into)
    2013-10-25 13:00:58下载
    积分:1
  • PSO
    梯度下降法是最早最简单,也是最为常用的最优化方法。梯度下降法实现简单,当目标函数是凸函数时,梯度下降法的解是全局解。一般情况下,其解不保证是全局最优解,梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向,因为该方向为当前位置的最快下降方向,所以也被称为是”最速下降法“。最速下降法越接近目标值,步长越小,前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)
    2018-01-29 21:44:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载