Concept
Generalized permutation matrix
Related publications (20)
From Trees to Barcodes and Back Again:A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem
In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...
EPFL2022Learning V1 Simple Cells with Vector Representation of Local Content and Matrix Representation of Local Motion
This paper proposes a representational model for image pairs such as consecutive video frames that are related by local pixel displacements, in the hope that the model may shed light on motion perception in primary visual cortex (V1). The model couples the ...
ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2022Unique decomposition of homogeneous languages and application to isothetic regions
A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...
2019The Minimal Faithful Permutation Degree For A Direct Product Obeying An Inequality Condition
The minimal faithful permutation degree (G) of a finite group G is the least nonnegative integer n such that G embeds in the symmetric group Sym(n). Clearly (G x H) (G) + (H) for all finite groups G and H. In 1975, Wright ([10]) proved that equality occurs ...
Taylor & Francis Inc2016Randomized Extended Kaczmarz For Solving Least Squares
We present a randomized iterative algorithm that exponentially converges in the mean square to the minimum l(2)-norm least squares solution of a given linear system of equations. The expected number of arithmetic operations required to obtain an estimate o ...
Society for Industrial and Applied Mathematics2013DynaProg for Scala
Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...
2013The Two-Well Problem For Piecewise-Affine Maps
In the two-well problem we look for a map u which satisfies Dirichlet boundary conditions and whose gradient Du assumes values in SO (2) A boolean OR SO (2) B = S-A boolean OR S-B, for two given invertible matrices A, B (an element of SO (2) A is of the fo ...
2012Multi-Way Compressed Sensing for Sparse Low-Rank Tensors
For linear models, compressed sensing theory and methods enable recovery of sparse signals of interest from few measurements-in the order of the number of nonzero entries as opposed to the length of the signal of interest. Results of similar flavor have mo ...
Institute of Electrical and Electronics Engineers2012Chebyshev interpolation for nonlinear eigenvalue problems
Daniel Kressner, Peter Cedric Effenberger
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix-valued function is computationally expensive. ...
Springer Netherlands2012Computing Codimensions And Generic Canonical Forms For Generalized Matrix Products
A generalized matrix product can be formally written as Lambda(sp)(p) Lambda(sp-1)(p-1) ... Lambda(s2)(2) Lambda(s1)(1) where s(i) is an element of {- 1,+ 1} and ( A(1), ..., A(p)) is a tuple of ( possibly rectangular) matrices of suitable dimensions. The ...
International Linear Algebra Society2011