Concept

Matrice de Vandermonde

Publications associées (35)

Coping with low modulation in speckle interferometry: a novel approach based on the Delaunay triangulation

Interferometric signals involving speckle waves invariably exhibit phase indeterminations. These indeterminations arise at the zero-intensities of the speckle fields, or singularities, and show themselves as a net loss of modulation depth of the interferom ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

Bit Precision Analysis for Compressed Sensing

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

This paper studies the stability of some reconstruction algorithms for compressed sensing in terms of the bit precision. Considering the fact that practical digital systems deal with discretized signals, we motivate the importance of the total number of ac ...

2009

Polymorphic nodal elements and their application in discontinuous Galerkin methods

Jan Sickmann Hesthaven

In this work, we discuss two different but related aspects of the development of efficient discontinuous Galerkin methods on hybrid element grids for the computational modeling of gas dynamics in complex geometries or with adapted grids. In the first part, ...

Elsevier2009

A parallel Schur method for solving continuous-time algebraic Riccati equations

Daniel Kressner, Bo Kågström

Numerical algorithms for solving the continuous-time algebraic Riccati matrix equation on a distributed memory parallel computer are considered. In particular, it is shown that the Schur method, based on computing the stable invariant subspace of a Hamilto ...

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

A path integral formalism of DNA looping probability

Ludovica Cotta-Ramusino

In this thesis we describe a path integral formalism to evaluate approximations to the probability density function for the location and orientation of one end of a continuum polymer chain at thermodynamic equilibrium with a heat bath. We concentrate on th ...

EPFL2008

Short Basis Functions for Constant-Variance Interpolation

Michaël Unser, Philippe Thévenaz, Thierry Blu

An interpolation model is a necessary ingredient of intensity-based registration methods. The properties of such a model depend entirely on its basis function, which has been traditionally characterized by features such as its order of approximation and it ...

SPIE2008

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007

The effects of the global structure of the mask in visual backward masking

Michael Herzog

The visibility of a target can be strongly affected by a trailing mask. Research on visual backward masking has typically focused on the temporal characteristics of masking, whereas non-basic spatial aspects have received much less attention. However, rece ...

Elsevier2007

High-Resolution Frequency Estimation Technique for Recovering Phase Distribution in Interferometers

Pramod Rastogi, Abhijit Patil, Rajesh Langoju

An integral approach to phase measurement is presented. First, the use of a high-resolution technique for the pixelwise detection of phase steps is proposed. Next, the robustness of the algorithm that is developed is improved by incorporation of a denoisin ...

OSA2005

On Matrix Rigidity and the Complexity of Linear Forms

Mahdi Cheraghchi Bashi Astaneh

The rigidity function of a matrix is defined as the minimum number of its entries that need to be changed in order to reduce the rank of the matrix to below a given parameter. Proving a strong enough lower bound on the rigidity of a matrix implies a nontri ...

2005

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search