Concept

Équation polynomiale

Publications associées (73)

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...

2007

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

Jean-Yves Le Boudec, Gianluca Rizzo

2007

Generalization of the RIN result to heterogeneous networks of aggregate schedulers and leaky bucket constrained flows

Jean-Yves Le Boudec, Gianluca Rizzo

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

Accurate Non-Iterative O(n) Solution to the PnP Problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem---the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences---whose computational complexity grows linearly with n. This is in contrast to state-of-the-art method that are ...

2007

Accurate non-iterative O(n) solution to the PnP problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences-whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O( ...

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

Signal Reconstruction from Multiple Unregistered Sets of Samples using Groebner Bases

Martin Vetterli, Luciano Sbaiz, Patrick Vandewalle

We present a new method for signal reconstruction from multiple sets of samples with unknown offsets. We rewrite the reconstruction problem as a set of polynomial equations in the unknown signal parameters and the offsets between the sets of samples. Then, ...

2006

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

Sampling and Reconstruction of Signals with Finite Rate of Innovation in the Presence of Noise

Martin Vetterli, Irena Maravic

Recently, it was shown that it is possible to develop exact sampling schemes for a large class of parametric nonban- dlimited signals, namely certain signals of finite rate of innovation. A common feature of such signals is that they have a finite number o ...

2005

Similarity solutions for solute transport in fractal porous media using a time-and scale-dependent dispersivity

David Andrew Barry, Fang Liu

A specific form of the Fokker–Planck equation with a time- and scale-dependent dispersivity is presented for modelling solute transport in saturated heterogeneous porous media. By taking a dispersivity in the form of separable power-law dependence on both ...

2005

Efficient electromagnetic analysis of line-fed aperture antennas in thick conducting screens

Juan Ramon Mosig, Ivica Stevanovic

This paper presents a numerical and experimental verification of an approximate but efficient integral equation technique for the scattering by apertures in conducting planes with finite thicknesses. The approach is based on a perturbation method and modif ...

2004

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