Concept

Système d'équations linéaires

Publications associées (403)

Time-Inhomogeneous Affine Processes

Affine processes are distinguished by their rich structural properties, which makes them favorite when it comes to computations in financial applications of all kind. This fact has been explored and illustrated for the time-homogeneous case in a recent pap ...

Elsevier2005

Variational reconstruction of scalar and vector images from non-uniform samples

Muthuvel Arigovindan

We address the problem of reconstructing scalar and vector functions from non-uniform data. The reconstruction problem is formulated as a minimization problem where the cost is a weighted sum of two terms. The first data term is the quadratic measure of go ...

EPFL2005

Computing with Reads and Writes in the Absence of Step Contention

Rachid Guerraoui

This paper studies implementations of concurrent objects that exploit the absence of step contention. These implementations use only reads and writes when a process is running solo. The other processes might be busy with other objects, swapped-out, failed, ...

2005

Variational Image Reconstruction from Arbitrarily Spaced Samples: A Fast Multiresolution Spline Solution

Michaël Unser, Michael Sühling, Muthuvel Arigovindan

We propose a novel method for image reconstruction from nonuniform samples with no constraints on their locations. We adopt a variational approach where the reconstruction is formulated as the minimizer of a cost that is a weighted sum of two terms: 1) the ...

IEEE2005

Superstabilizing, Fault-containing Multiagent Combinatorial Optimization

Boi Faltings

Self stabilization in distributed systems is the ability of a system to respond to transient failures by eventually reaching a legal state, and maintaining it afterwards. This makes such systems particularly interesting because they can tolerate faults, an ...

2005

Approximations in Distributed Optimization

Boi Faltings, Adrian Petcu

We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...

2005

An invariant matrix structure in multiantenna communications

Ali H. Sayed

This letter shows that the matrix structure with 2/spl times/2 Alamouti sub-blocks remains invariant under several nontrivial matrix operations, including matrix inversion, Schur complementation, Riccati recursion, triangular factorization, and QR factoriz ...

IEEE2005

Preferential Estimation for Uncertain Linear Systems at Steady State: Application to Filamentous Fungal Fermentation

Dominique Bonvin, Levente Bodizs

State estimation is a widely used concept in the control community, and the literature mostly concentrates on the estimation of all states. However, in soft sensor problems, the emphasis is on estimating a few soft outputs as accurately as possible. The co ...

2005

Electron heat transport in shaped TCV L-mode plasmas

Olivier Sauter, Stefano Coda, Timothy Goodman, Laurie Porte, Alexander Karpushov, Antoine Pochelon, Yann Camenen, Roland Behn, Alberto Bottino

Electron heat transport experiments are performed in L-mode discharges at various plasma triangularities, using radially localized electron cyclotron heating to vary independently both the electron temperature T-e and the normalized electron temperature gr ...

2005

Absolute Standard Redox Potential of Monolayer-Protected Gold Nanoclusters

Hubert Girault, Bin Su

The redox properties of monolayer-protected gold nanoclusters (MPCs) are considered from both the theoretical and experimental viewpoints. The “absolute standard redox potential” ([ ]abs) of MPCs is first derived from electrostatic considerations. A linear ...

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