搜索资源列表
treewave
- Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the w
TRIEIGE
- computes the eigenvalues of a symmetric tridiagonal * matrix T. The user may ask for all eigenvalues, all eigenvalues in the half-open interval (VL, VU], or the IL-th through IU-th eigenvalues.-computes the eigenvalues of a symmetric tr idiagona
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
matrix
- 矩阵运算程序 matrix.h 基于TCL Matrix矩阵类，增加了一些使用的运算函数。具体看源程序。 功能分析： 本程序能完成矩阵的输入、输出。具有相同行数和列数的矩阵间的加法、减法、乘法、除法、求逆、求代数余子式、求伴随矩阵、求行列式值、求条件数等运算。符合矩阵乘法规则要求的矩阵间的乘法。方阵间的除法，方阵的求逆。矩阵的求转置矩阵等功能。 文件 TCL Matrix矩阵类.pdf 中介绍了其详细的使用方法。 -Matrix calculation program mat
SVM
- In this paper, we show how support vector machine (SVM) can be employed as a powerful tool for $k$-nearest neighbor (kNN) classifier. A novel multi-class dimensionality reduction approach, Discriminant Analysis via Support Vectors (SVDA), is in
PrimAlgorithm
- 最小生成树prim算法，Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
MinimumspanningtreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn file name given input parameters and format that is called prim before Input adjacency matrix D and node numbers n input prim are two lines of the matrix T, the numbe
Thomas
- 当线性代数联立方程组的系数矩阵为三对角阵T时，可将T分解为主对角元素为1的下三角阵L和另一个右三角阵R的积。-Simultaneous linear algebraic equations when the coefficient matrix is tridiagonal matrix T, can break down the main diagonal elements of T 1 of the lower triangular matrix L and the other right-
fit_mix_2D_gaussian
- fit_mix_2D_gaussian - fit parameters for a 2D mixed-gaussian distribution using EM algorithm format: [u,covar,t,iter] = fit_mix_2D_gaussian( X,M ) input: X - input samples, Nx2 vector M - number of gaussians which are assumed to compose the
T-matrix
- T矩阵方法的FORTRAN环境下的程序，希望对大家有帮助！-T matrix method program FORTRAN environment, we want to help!
Prim-suan-fa
- Dandn文件给出了输入参数的名称及格式，即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn file gives the name and format of the input parameters, namely, the input before calling the prim adjacency matrix D and the number of nodes n prim get two lines of the
sequence-alignment-matrix-
- 求解序列比对得分矩阵，对于两个序列S和T，令[S]和[T]分别为序列S和T的长度，S[i]和T[j](其中正整数i，j满足0≤j< [S]和0≤j <[T])都属于字符集Ω={A,T,C,G,-},对Ω中的任何元素和空符号。 设计S[i]和T[j]两两之间的一个记分值来比较序列间的同一性的优劣,用记分函数σ(x，y)表示， σ(S[i],T[j])=2 ( S[i]=T[j]≠-)；σ(S[i],T[j])= -1 ( S[i]≠T[j],S[i]≠-,T[j]≠-)；σ(S
Prim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim，得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name and format of the input parameters Before calling prim enter the adjacency matrix D and the number of nodes n Input Prim, two rows o
Matrix-Checking-Functions
- Matlab Functions for determining if certaion matrix is: 1) Symmetric 2) Lower/Upper triangular (Unit/Strictly/Non-Strictly) 3) n-Banded 4) (Strictly) Diagonally Dominant 5) Isn t it positive definite
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法。Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可。-Prim minimum spanning tree algorithm. The file of Dandn up and down two rows of numbers corresponding node connected to the name and format of the input parameter
Prim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name and format of the input parameters before calling prim enter the adjacency matrix D and the number of nodes n input prim two rows of the
R-and-T-for-two-arrays
- 程序r_t用来计算两组空间坐标点之间的旋转平移关系。调用方式如下： p1=[x11,x12,...,x1n y11,y12,...,y1n z11,z12,...,z1n] n个控制点在第一个坐标系下的坐标 p2=[x21,x22,...,x2n y21,y22,...,y2n z21,z22,...,z2n] n个控制点在第二个坐标系下的坐标 RT=r_t(p1,p2) 两个坐标系直接的旋转平移关系,表示方式为RT=[R T] 注：p1和p2也可提供齐次坐标-for RT
complex
- calculate matrix T complex
jordan
- calculate matrix T and matriz jordan when roots are complex
tdfFileOpen
- D is the dimension vector, R the rotation matrix, T the translation vector of the calibrated volume LINKS is a [2,nLinks] adjacency list of links: if exists linkIdx such that links(:,linkIdx) == [track1 track2] then a link exists connectin