登录
首页 » Java » Projection

Projection

于 2013-07-25 发布 文件大小:3KB
0 260
下载积分: 1 下载次数: 3

代码说明:

  this is source code about extracting cars number

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

发表评论

0 个回复

  • copulas
    copulas参数估计方法的源代码。copulas为一种统计方法。(copulas parameter estimation method of the source code. copulas is a statistical method.)
    2013-10-13 18:24:32下载
    积分:1
  • shear-frame-model
    剪切框架模型动力响应分析,即糖葫芦串形式的结构动力响应计算(dynamic response for shea frame model)
    2020-08-15 12:18:26下载
    积分:1
  • lvboqi
    说明:  这是个关于滤波器实验,有学习滤波器的可以看看(This is about the filter, the experimental study filter can see)
    2010-04-08 16:19:00下载
    积分:1
  • ComputationalStatisticsMatlab
    Matlab的书籍的统计方法计算,这本书包含源代码(Matlab books, on the calculation of statistics, the book contains the source code)
    2010-05-13 12:08:07下载
    积分:1
  • CreateSig
    i hav uploaed the signal creating code
    2012-09-27 19:34:52下载
    积分:1
  • camip300_01
    the P300 (P3) wave is an event related potential (ERP) elicited in the process of decision making.
    2012-03-14 11:08:00下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • fastica
    fast ICA的源文件 独立成分分析 MATLAB工具箱里也有 可以下载到工具箱 安装后就可以使用了(fast ICA Independent component analysis of the source file MATLAB toolbox is also available for download to install, ready to use the toolbox)
    2010-09-14 15:15:10下载
    积分:1
  • orical
    orical ppt学习,适合初学者,需要的可以下载哦(orical ppt)
    2010-12-16 13:30:43下载
    积分:1
  • baba_gui
    basic fourier series gui for beginners
    2011-01-30 17:02:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载