This is not a very mean things
上传时间： 2014-01-09
上传用户：sy_jiadeyi
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTPUT: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
标签： points the minimize respect
上传时间： 2014-01-02
上传用户：gyq
square算法 Square加密解密算法 8k tinker.tar.gz Square加密解密算法 43k Square26.zip
上传时间： 2015-12-25
上传用户：yy541071797
％ A 2D homogeneous convection-diffusion case (u=exp(-ex*deta*x-ex*deta*y) with a square with ％ all Dirichlet boundary, note that reaction coefficient is not zero ％ by indirect BKM
标签： convection-diffusion deta with homogeneous
上传时间： 2016-01-03
上传用户：CHINA526
A 2D homogeneous Helmholtz case (u=sin(x)cos(y) with a square) with ％ two Dirichlet edges (x=1,y=1) and two Neumann edges (x=0,y=0) ％ by indirect symmetric BKM
标签： with homogeneous Helmholtz Dirichlet
上传时间： 2016-01-03
上传用户：xjz632
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.
标签： the decision clusters Cluster
上传时间： 2013-12-21
上传用户：gxmm
简要介绍mean-shift算法的原理，并且在图像处理方面的应用
标签： mean-shift 算法
上传时间： 2014-01-07
上传用户：钓鳌牧马
a java code of moving square game
上传时间： 2014-01-15
上传用户：qw12
To invert a square Galois array, use the inv function. Related is the det function, which computes the determinant of a Galois array.
标签： function the computes Related
上传时间： 2014-01-10
上传用户：yiwen213
一个聚类算法用K-mean处理后迭代，论文发表在PAK
上传时间： 2013-12-09
上传用户：66666
