Concept

Irreducible polynomial

Related publications (57)

Reaching Correlated Equilibria Through Multi-agent Learning

Many games have undesirable Nash equilibria. For exam- ple consider a resource allocation game in which two players compete for an exclusive access to a single resource. It has three Nash equilibria. The two pure-strategy NE are effi- cient, but not fair. ...

2011

Comparative Analysis of Various Single-tone Frequency Estimation Techniques in High-order Instantaneous Moments Based Phase Estimation Method

Pramod Rastogi, Sai Siva Gorthi

For phase estimation in digital holographic interferometry, a high-order instantaneous moments (HIM) based method was recently developed which relies on piecewise polynomial approximation of phase and subsequent evaluation of the polynomial coefficients us ...

AIP Conf. Proc.2010

Estimation of Phase in Fringe Projection Technique Using High-order Instantaneous Moments Based Method

Pramod Rastogi, Sai Siva Gorthi

For three-dimensional (3D) shape measurement using fringe projection techniques, the information about the 3D shape of an object is encoded in the phase of a recorded fringe pattern. The paper proposes a high-order instantaneous moments based method to est ...

AIP Conf. Proc.2010

Phase estimation in digital holographic interferometry using cubic phase function based method

Pramod Rastogi, Sai Siva Gorthi

The paper introduces a cubic-phase-function based method to estimate interference phase in digital holographic interferometry. The proposed method relies on piecewise polynomial approximation of phase by dividing an arbitrary row/column of the complex reco ...

Taylor & Francis2010

Vinberg's theta-groups in positive characteristic and Kostant-Weierstrass slices

We generalize the basic results of Vinberg's theta-groups, or periodically graded reductive Lie algebras, to fields of good positive characteristic. To this end we clarify the relationship between the little Weyl group and the (standard) Weyl group. We ded ...

Birkhäuser-Verlag, Springer2009

Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox

Michel Deville, Nicolas Fietier, Vincent Keller, Roland Bouffanais, Jonas Marcel Lätt, Christoph Bosshard, Sohrab Jairo Kehtari, Christian Clémençon

In this paper, a comprehensive performance review of all MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of aspects with a particular emphasis on the parallel efficienc ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Column Generation for the Split Delivery VRP

Matteo Salani

In this paper we tackle a variation of the Vehicle Routing Problem (VRP) in which each customer can be served by more than one vehicle, each serving a fraction of its demand. This problem is known as the Split Delivery VRP (SDVRP). Due to the potential sav ...

2008

Invariant generation for P-solvable loops with assignments

Laura Ildiko Kovacs

We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and co ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Computing Gröbner fans

This paper presents algorithms for computing the Gröbner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Gröbner bases of the ideal. Our algorithms are based on a uniform definition of the Gröbner fan that applies ...

2007

Identification of a Two-Input System: Variance Analysis

Dominique Bonvin, Alireza Karimi, Ljubisa Miskovic

This paper examines the identification of a single-output two-input system. Motivated by an experiment design problem(should one excite the two inputs simultaneously or separately), we examine the effect of the (second) input signal on the variance of the ...

2005

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.