Welcome![Sign In][Sign Up]
Location:
Search - Euclidean

Search list

[Mathimatics-Numerical algorithmscluster

Description: 我做的用Kmeans方法,分别采用欧式距离。夹角余弦,和度量函数的方法来表示两点的相似度-I do use Kmeans methods were used Euclidean distance. Angle cosine, and methods of measurement functions to represent the similarity of two
Platform: | Size: 55296 | Author: bing | Hits:

[MySQLjuleifenxi

Description: 聚类分析 计算x中两两之间的欧氏距离 Road Thunder of calculating x in 22 Euclidean distance between-Road Thunder of calculating x in 22 Euclidean distance between
Platform: | Size: 1024 | Author: 陈慧 | Hits:

[OtherLAMATLAB

Description: One of the nice features of MATLAB is its ease of computations with vectors and matrices. In this tutorial the following topics are discussed: vectors and matrices in MATLAB, solving systems of linear equations, the inverse of a matrix, determinants, vectors in n-dimensional Euclidean space, linear transformations, real vector spaces and the matrix eigenvalue problem. Applications of linear algebra to the curve fitting, message coding and computer graphics are also included.
Platform: | Size: 92160 | Author: psycrystal | Hits:

[CSharp78-90790

Description: 欧几里德最大公因子算法 欧几里德最大公因子算法-Euclidean algorithm Euclidean greatest common factor greatest common factor algorithm
Platform: | Size: 41984 | Author: YBBTMVTK | Hits:

[AI-NN-PReuclidean_watershed_Segment

Description: 用matlab实现的欧氏分水岭分割源码,十分方便-Achieved with the Euclidean matlab source watershed segmentation, very convenient
Platform: | Size: 1024 | Author: 严德春 | Hits:

[Otherojld

Description: 运用欧几里得算法求解最大公约数,并对算法的时间性能进行分析 -Greatest common divisor using the Euclidean algorithm, and analyze the performance of the algorithm time
Platform: | Size: 1024 | Author: Sher | Hits:

[AlgorithmGreatest_common_factor

Description: 我使用數學中輾轉相除法來求"最大公因數" 有需要的同好可以下載使用-I use math in the Euclidean algorithm to achieve " the greatest common divisor" in need of enthusiasts can download ^ ^
Platform: | Size: 1024 | Author: 陳郁文 | Hits:

[Crack Hackshanks

Description: 求离散对数的shanks算法,要求如下: 实现计算 Zp 中计算离散对数的 Shanks 算法,基本要求如下: 1)p 是一个小素数( 小于 32 bit ),a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试); 2)采用快速模指数算法求幂(如am),采用扩展欧几里得算法求逆( 如a-i (mod p) ); 3)采用一种好的排序算法对 L1、L2 排序; 4)采用概率算法(如Miller Rabin算法)自动生成素数 p,采用本原元的充要条件自动生成 a;-Discrete number of shanks on demand algorithm, the following: calculation of Zp calculated to achieve the discrete logarithm Shanks algorithm, the basic requirements are as follows: 1) p is a small prime number (less than 32 bit), a is a primitive element. Process input (p, a, b), output logab (mod p) (can use log3525 (mod 809) so as a test) 2) The fast mode index algorithm to solve the power (such as the am), using extended Euclidean Reed inverse algorithm (such as ai (mod p)) 3) use a good sorting algorithm on the L1, L2 sort 4) using probabilistic algorithms (such as the Miller Rabin algorithm) automatically primes p, using primitive element automatically generate the necessary and sufficient conditions a
Platform: | Size: 7559168 | Author: vince | Hits:

[AlgorithmEUCLID

Description: 辗转欧几里得算法 求多项式逆 网路安全中的算法-Inverse polynomial Euclidean algorithm was removed network security algorithms
Platform: | Size: 247808 | Author: foxsmile | Hits:

[Special Effectsfenleiqi

Description: 本程序给出了从背景中分离出行人的matlab源代码.采用提取好的背景和行人的HOG特征,而这些特征又分为未分块和分块两组,所谓分块就是将图片进行细分,提取的特征更细.最后用最小欧氏距离法分类.-This procedure gives the background to separate from the travel people matlab source code. By extracting a good background and pedestrian HOG features, and these features are not divided into blocks and blocks Liangzu, the so-called sub-block is to carry out detailed pictures points, the extracted features more detailed. Finally, the smallest Euclidean distance classification.
Platform: | Size: 3232768 | Author: aimeelove | Hits:

[OtherPloyn

Description: java实现多项式加法,乘法,除法,利用辗转相除法求两个多项式的最大公因子-java achieve polynomial addition, multiplication, division, using Euclidean algorithm for greatest common divisor of two polynomials
Platform: | Size: 77824 | Author: 李军 | Hits:

[matlabANT_TSP

Description: 以matlab撰写的ACO算法,很适合用于研究Ant colony algorithms。-Write a MATLAB program to solve the following given city Euclidean traveling salesman problem (given lattice points) by using ant-cycle algorithm.
Platform: | Size: 168960 | Author: Vlog | Hits:

[3D Graphic3DGraphicsProgrammingGuide

Description: 总目录 第一章 硬件接口 3D应用程序与硬件的交互作用 在计算机屏幕上显示图像 事件反应 使用不同的体系结构 第二章 3D变换 欧几里得空间,自由度和基本变换 平移 缩放 在平面内旋转 3D旋转 坐标系 变换次序 以矩阵形式表达变换 投影变换 第三章 2D图元光栅处理 第四章 2D和3D裁剪 第五章 视处理 第六章 建模 第七章 隐面消除 第八章 光线 第九章 构建3-D应用程序的实践方面 -General Table of Contents Chapter hardware interface hardware 3D applications and the interaction of display images on the computer screen using a different incident response architecture Chapter 3D transformation Euclidean space, freedom and fundamental transformation translation scaling rotation in the 3D plane rotating coordinate system transformation matrix of the order of the expression of transform 2D map projection transformation element grating chapter dealing with 2D and 3D cutting Chapter IV Chapter V Chapter VI, as the processing hidden surface removal modeling VII Chapter VIII Chapter IX Construction of light 3- D application practices
Platform: | Size: 1170432 | Author: zhouyongbing | Hits:

[matlabplotpointsGradient

Description: This function allow to plot a series of points represented in omogeneous coordinates or euclidean ones
Platform: | Size: 1024 | Author: Ale | Hits:

[VHDL-FPGA-VerilogEuclid_100722

Description: 欧氏距离算法计算错误位置多项式,是Berlekamp-Massey的替代算法。消耗的硬件资源比Berlekamp-Massey算法多,但是可以更节省运算时间。-Euclidean distance algorithm to calculate the error position polynomial, is an alternative Berlekamp-Massey algorithm. The consumption of hardware resources is more than the Berlekamp-Massey algorithm, but can also save computing time.
Platform: | Size: 240640 | Author: 彭洪 | Hits:

[Graph RecognizeVCnunRecognition

Description: VC手写数字识别代码,采用的是欧式距离法-VC handwritten digital code, using the Euclidean distance method
Platform: | Size: 1893376 | Author: xhb | Hits:

[JSP/JavaCommon-factor

Description: Java 程序 源码 用辗转相除法求两个整数的最大公因数。-Java source code using Euclidean algorithm for greatest common factor of two integers.
Platform: | Size: 2048 | Author: cauchyjjd | Hits:

[Data structsRecursiveAlgorithmForTransformationOfQuot

Description: 递归算法改造"求最大公因数"的欧几 里 得 算 法,华大出品-Recursive algorithm for transformation of " seeking the greatest common factor" of the Euclidean algorithm, UW produced
Platform: | Size: 1024 | Author: moxingwen | Hits:

[Special EffectsContent-basedImageRetrieval

Description: 基于内容(颜色)的图像检索,用VC++实现算法——欧氏距离,可以在指定的目录下搜索相似的图案,旗帜,冬景等,是图像检索的最简单的模型,感兴趣的可以下载看看。-Content-based (color) image retrieval, using VC++ algorithm- Euclidean distance, you can search the directory specified similar pattern, flags, winter landscape, are the simplest retrieval model, interested can download look.
Platform: | Size: 5995520 | Author: 陈杨 | Hits:

[matlabdistancess2curve

Description: Minimize the Euclidean distance to a general space curve from a
Platform: | Size: 15360 | Author: samsom | Hits:
« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 50 »

CodeBus www.codebus.net