Concept

Generalized permutation matrix

Related publications (20)

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

Binaural Audio Signal Processing Using Interaural Coherence Matching

Fritz Menzer

Binaural room impulse responses (BRIRs) characterize the transfer of sound from a source in a room to the left and right ear entrances of a listener. Applying BRIRs to sound source signals enables headphone listening with the perception of a three dimensio ...

EPFL2010

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

Horocyclic products of trees

Let T-1, ... , T-d be homogeneous trees with degrees q(1) + 1, ... , q(d) + 1 >= 3; respectively. For each tree, let h : Tj -> Z be the Busemann function with respect to a fixed boundary point ( end). Its level sets are the horocycles. The horocyclic produ ...

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

A fast algorithm for subspace state-space system identification via exploitation of the displacement structure

Daniel Kressner

Two recent approaches (Van Overschee, De Moor, N4SID, Automatica 30 (1) (1994) 75; Verhaegen, Int. J. Control 58(3) (1993) 555) in subspace identification problems require the computation of the R factor of the QR factorization of a block-Hankel matrix H, ...

Elsevier2001

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.