Search - permutation matrix

Search - permutation matrix - List

[Special Effects] zsort DL : 0: 一个把给定矩阵（图像）按ZigZag排序的算法，高级程序员编写，非常精炼，可供图像处理编程人员参考。-put to a fixed matrix (Image) by permutation sorting algorithm, senior programmer preparation, very refined image processing program for reference.
Update : 2008-10-13 Size : 24.85kb Publisher : RF
[Special Effects] zsort DL : 0: 一个把给定矩阵（图像）按ZigZag排序的算法，高级程序员编写，非常精炼，可供图像处理编程人员参考。-put to a fixed matrix (Image) by permutation sorting algorithm, senior programmer preparation, very refined image processing program for reference.
Update : 2025-02-19 Size : 25kb Publisher : QHLee
[Compress-Decompress algrithms] ju DL : 0: 矩阵的实现,相加,相左,相乘，上三角，下三角，置换-Matrix realization of the sum, at odds, multiply, upper triangular, lower triangular, permutation
Update : 2025-02-19 Size : 9kb Publisher : karfield
[Crack Hack] zhihuan DL : 0: 置换密码算法的原理是不改变明文字符，只将字符在明文中的排列顺序改变，从而实现明文信息的加密。置换密码也叫换位密码。试编程实现矩阵换位密码。它的加密方法是将明文中的字母按照给定的顺序安排在一个矩阵中，然后用根据密钥提供的顺序重新组合矩阵中的字母，形成密文。-Permutation cipher does not change the principle is expressly characters, only characters in the explicit change in order to achieve explicit information encryption. Password replacement is also called transposition password. Programming test matrix transposition password. Its encryption method is to express the letter in accordance with the order given in a matrix, and then use the key provided in accordance with the order re-arrangement of the letters in the matrix to form a ciphertext.
Update : 2025-02-19 Size : 1kb Publisher : rose
[Mathimatics-Numerical algorithms] GEE DL : 0: 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 functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
Update : 2025-02-19 Size : 10kb Publisher : Allan KAO
[Algorithm] ldiv DL : 0: 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 functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
Update : 2025-02-19 Size : 1kb Publisher : Allan KAO
[Embeded-SCM Develop] LoopN DL : 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 as follows: 1. There is a string matrix, with vector < vector < CStirng> > express 2. Line and line 3 between the permutation and combination. Output for all combinations of string
Update : 2025-02-19 Size : 9kb Publisher : 冷秋魂
[Windows Develop] permm DL : 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
Update : 2025-02-19 Size : 2kb Publisher : Sama
[matlab] signperm DL : 0: Determinant of the permutation matrix with rows ordered by p.
Update : 2025-02-19 Size : 1kb Publisher : katore vishal
[Console] LU DL : 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. This decomposition is used in numerical analysis to solve systems of linear equations or calculate the determinant of a matrix.
Update : 2025-02-19 Size : 2kb Publisher : James
[Special Effects] 7 DL : 0: 本文提出一种基于核方法的下视等分辨率景象匹配算法. 通过模拟电荷吸引模型, 提出了计算不等维高维数据相似度的SNN 核函数. 将图像中的特征点映射到径向基向量(Radial basis vector, RBV) 空间, 利用SNN 核函数计算两个特征点集的相似度及过渡矩阵. 利用置换测试模块来增强SNN 核的稳定性, 以确保输出解的可靠性. 实验证明, 基于SNN 核的景象匹配算法对图象畸变、噪声干扰与信号缺失具有很强的鲁棒性, 并可保证高精度与高实时性. -This paper presents a method based on kernel resolution of the next scene, as the other matching algorithms. Attracted by charge simulation model for computing the data ranging from high-dimensional similarity dimension SNN kernel function. The image feature points mapped to the radial basis vector (Radial basis vector, RBV) space, calculated using SNN kernel similarity of two feature point sets and the transition matrix. permutation test module to enhance the stability of the nuclear SNN to ensure the reliability of the output solution. Experiments show that SNN-based scene matching algorithm kernel image distortion, noise and signal loss are highly robust, and can ensure high precision and high real time.
Update : 2025-02-19 Size : 662kb Publisher : wenping
[matlab] quan-pai-lie-ju-zhen DL : 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 J and N.
Update : 2025-02-19 Size : 1kb Publisher : 欢银
[Crack Hack] zhihuanjiami DL : 0: 置换密码亦称换位密码。置换只不过是一个简单的换位。每个置换都可以用一个置换矩阵来表示。每个置换都有一个与之对应的逆置换。置换密码的特点是仅有一个发送方和接收方知道的加密置换（用于加密）和对应的逆置换（用于解密）。它是对明文长字母组中的字母位置进行重新排列，而每个字母本身并不改变。-Password replacement, also known as transposition cipher. Replacement is just a simple transposition. Each permutation can be represented by a permutation matrix. Each exchange has a corresponding inverse permutation. Replacement of the password feature is only one sender and receiver know the encryption permutation (for encryption) and the corresponding inverse permutation (for decryption). It is a long letter of the plaintext letters in the group re-arranged location, and each letter in itself does not change.
Update : 2025-02-19 Size : 1kb Publisher : 张华
[Software Engineering] matrix-transpose-operation DL : 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.The transpose method: direct exchange ranks reordering. Transpose Method 2: Perform n scans. Transpose 3: Fast transpose.
Update : 2025-02-19 Size : 1kb Publisher : 高伟
[Software Engineering] Permutatiuon DL : 0: Matlab permutation matrix
Update : 2025-02-19 Size : 1kb Publisher : Mohan
[Other] Decompose DL : 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.
Update : 2025-02-19 Size : 3kb Publisher : Jing Xu
[Algorithm] resolution_Lu DL : 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 as well. The LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using the LU decomposition, and it is also a key step when inverting a matrix, or computing the determinant of a matrix. The LU decomposition was introduced by mathematician Alan Turing.[1]-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 as well. The LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using the LU decomposition, and it is also a key step when inverting a matrix, or computing the determinant of a matrix. The LU decomposition was introduced by mathematician Alan Turing.[1]
Update : 2025-02-19 Size : 20kb Publisher : zineb24
[matlab] munkres DL : 0: Hungarian algorithm - finds the closet permutation matrix to a target matrix.
Update : 2025-02-19 Size : 2kb Publisher : rabati
[Algorithm] resolution_gauss_descents DL : 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 matrix as well. The LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using the LU decomposition, and it is also a key step when inverting a matrix, or computing the determinant of a matrix. The LU decomposition was introduced by mathematician Alan Turing.[1]-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 matrix as well. The LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using the LU decomposition, and it is also a key step when inverting a matrix, or computing the determinant of a matrix. The LU decomposition was introduced by mathematician Alan Turing.[1]
Update : 2025-02-19 Size : 22kb Publisher : cerisette_maroc
[matlab] ccabss DL : 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 estimate of S appart from permutation and scaling. For mixed 1-D signals, X is 2-D. The first index refer to the different components and the second index refers to the signal parameter (e.g. time) For mixed images, X is 3-D where the first index refers to the different mixed images and the second and third indeces are the spatial coordinates. [Y W] = CCABSS(X) also gives the de-mixing matrix W, such that Y = W *X.-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 estimate of S appart from permutation and scaling. For mixed 1-D signals, X is 2-D. The first index refer to the different components and the second index refers to the signal parameter (e.g. time) For mixed images, X is 3-D where the first index refers to the different mixed images and the second and third indeces are the spatial coordinates. [Y W] = CCABSS(X) also gives the de-mixing matrix W, such that Y = W *X.
Update : 2025-02-19 Size : 1kb Publisher : harish bsv

« 12 »