Publications associées à Generalized permutation matrix

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 invol ...

EPFL2022

Learning V1 Simple Cells with Vector Representation of Local Content and Matrix Representation of Local Motion

Yufan Ren, Siyuan Huang

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 INTELLIGENCE2022

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

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 ...

2019

Randomized Extended Kaczmarz For Solving Least Squares

Nikolaos Freris

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 Mathematics2013

The Two-Well Problem For Piecewise-Affine Maps

Bernard Dacorogna

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 ...

2012

Multi-Way Compressed Sensing for Sparse Low-Rank Tensors

Anastasios Kyrillidis

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 ...

IEEE Institute of Electrical and Electronics Engineers2012

Chebyshev 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 Netherlands2012

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

The effect of matrix characteristics on fibroblast proliferation in 3D gels

Matthias Lütolf, Jeffrey Alan Hubbell, Simone Rizzi, Martin Ehrbar

Engineering synthetic hydrogels on a molecular basis to introduce natural features that are important in instructing cell behavior is becoming increasingly crucial in biomaterial-based approaches for regenerative medicine and in cell biology to study cell– ...

Elsevier2010

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polar codes were recently introduced by Arikan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely rel ...

2010

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polarization codes were recently introduced by Ar\i kan. They are explicit code constructions which achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels (and even extensions thereof) under a low complexity successive decodi ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Average case analysis of sparse recovery with Thresholding: New bounds based on average dictionary coherence

Pierre Vandergheynst, Mohammad Golbabaee

This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabilistic signal model which assumes randomness for both the amplitude and also ...

2008

Recognition of generalized network matrices

Antoine Musitelli

In this thesis, we deal with binet matrices, an extension of network matrices. The main result of this thesis is the following. A rational matrix A of size n×m can be tested for being binet in time O(n6m). If A is binet, our algorithm outputs a nonsingular ...

EPFL2007

Algebraic methods for channel coding

Frédérique Oggier

This work is dedicated to developing algebraic methods for channel coding. Its goal is to show that in different contexts, namely single-antenna Rayleigh fading channels, coherent and non-coherent MIMO channels, algebraic techniques can provide useful tool ...

EPFL2005