当前位置：
首页 资源下载
搜索资源 - permutation matrix
搜索资源列表
-
0下载：
一个把给定矩阵（图像）按ZigZag排序的算法，高级程序员编写，非常精炼，可供图像处理编程人员参考。-put to a fixed matrix (Image) by permutation sorting algorithm, senior programmer preparation, very refined image processing program for reference.
-
-
1下载：
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively.
The fu
-
-
1下载：
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively.
The fu
-
-
0下载：
使用递归实现N重循环，这里的N是不确定的。此代码实现的功能描述如下：
1. 有一个字符串的矩阵，用vector< vector< CStirng > > 表示
2. 行与行之间进行排列组合
3. 输出所有组合的字符串-Recursive use of re-implementation cycle of N, where N is uncertain. This code describes the implementation of the function
-
-
0下载：
From given order of rearrangement constructs the permutation matrix P and computes B = P *A*P-From given order of rearrangement constructs the permutation matrix P and computes B = P*A*P
-
-
0下载：
Determinant of the permutation matrix with rows ordered by p.
-
-
0下载：
In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as well
-
-
0下载：
本文提出一种基于核方法的下视等分辨率景象匹配算法. 通过模拟电荷吸引模型, 提出了计算不等维高维数据相似度的SNN 核函数. 将图像中的特征点映射到径向基向量(Radial basis vector, RBV) 空间, 利用SNN 核函数计算两个特征点集的相似度及过渡矩阵. 利用置换测试模块来增强SNN 核的稳定性, 以确保输出解的可靠性. 实验证明, 基于SNN 核的景象匹配算法对图象畸变、噪声干扰与信号缺失具有很强的鲁棒性, 并可保证高精度与高实时性.
-This paper prese
-
-
0下载：
全排列矩阵，依次输入exchange swap tianchongJ即可，若想修改全排列矩阵的大小，可在MATLAB中打开tianchongJ修改J和N。
-Permutation matrix, followed by the input exchange swap tianchongJ can, if you want to modify the size of permutation matrix can be modified in MATLAB to open tianchongJ
-
-
0下载：
置换密码亦称换位密码。置换只不过是一个简单的换位。每个置换都可以用一个置换矩阵 来表示。每个置换都有一个与之对应的逆置换 。置换密码的特点是仅有一个发送方和接收方知道的加密置换（用于加密）和对应的逆置换（用于解密）。它是对明文 长字母组中的字母位置进行重新排列，而每个字母本身并不改变。-Password replacement, also known as transposition cipher. Replacement is just a simple transposition. Each
-
-
0下载：
稀疏矩阵的三元组存储及其转置运算。使用三元组存储以下稀疏矩阵，并使用3种转置算法进行转置。转置方法1：直接交换行列，再排序。 转置方法2：执行n次扫描。 转置方法3：快速转置。-Triple store sparse matrix transpose operation.Using a sparse matrix, the following triple store and use three kinds of the permutation algorithm to transpose.Th
-
-
0下载：
Matlab permutation matrix
-
-
0下载：
将doubly stochastic matrix分解成一个排列矩阵的集合，并构造其概率分布-The doubly stochastic matrix is decomposed into a set of permutation matrix，at the same time，its probability distribution is constructed.
-
-
0下载：
In linear algebra, LU decomposition (where LU stands for Lower Upper , and also called LU factorization) factors a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix
-
-
0下载：
Hungarian algorithm - finds the closet permutation matrix to a target matrix.
-
-
0下载：
In numerical analysis, LU decomposition (where LU stands for Lower Upper , and also called LU factorization) factors a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation mat
-
-
0下载：
CCABSS - Blind Source Separation by Canonical Correlation Analysis
Y = CCABSS(X) is the BSS of X=A*S where S is a set of unknown source signals
and A is an unknown mixing matrix. The components in S are supposed to
be independent. Y is an es
-
-
0下载：
FastCSMatrix: The operator form of the contraint matrix for the fast compressed sensing problem.
Specifically, it returns y = A*x (mode = 1) or y = A *x (mode = 2), where A is an mxn matrix given by A = [Phi - Phi], and Phi = P*H*Q, where P,Q are r
-
-
0下载：
tspData <- read.csv( D:\\weka\\hw\\TSP.csv , header = T, sep = , )
#tspData <- `colnames<-`(tspData,c(1:8))
D <- as.matrix(tspData)
tourLength <- function(tour, distMatrix)
{ tour <- c(tour, tour[1])
route <- embed(tou
-
-
0下载：
置换密码算法的原理是不改变明文字符，只将字符在明文中的排列顺序改变，从而实现明文信息的加密。置换密码也叫换位密码。
试编程实现矩阵换位密码。它的加密方法是将明文中的字母按照给定的顺序安排在一个矩阵中，然后用根据密钥提供的顺序重新组合矩阵中的字母，形成密文。例如，明文为attack begins at five，密钥为cipher，将明文按照每行6个字母的形式排在矩阵中，如下形式：
a t t a c k
b e g i n s
a t f i v e
根据密钥ciphe
-
