Publication

Fixed point analysis of the constant modulus algorithm

Publications associées (64)

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

Model selection for partial least squares calibration and implications for analysis of atmospheric organic aerosol samples with mid-infrared spectroscopy

Satoshi Takahama

In developing partial least squares calibration models, selecting the number of latent variables used for their construction to minimize both model bias and model variance remains a challenge. Several metrics exist for incorporating these trade-offs, but t ...

Wiley-Blackwell2015

Budgeted sensor placement for source localization on trees

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

2015

Noether's theorem for dissipative quantum dynamical semi-groups

Tudor Ratiu

Noether's theorem on constants of the motion of dynamical systems has recently been extended to classical dissipative systems (Markovian semi-groups) by Baez and Fong [J. Math. Phys. 54, 013301 (2013)]. We show how to extend these results to the fully quan ...

Amer Inst Physics2015

Supramenable groups

Julian Kellerhals

In this thesis we investigate the class of supramenable groups. In the first part we give an overview of some analogous characterizations of amenable and supramenable groups. This is followed by the study of two properties close to supramenability: megamen ...

EPFL2014

Existence Of Solutions For Jacobian And Hessian Equations Under Smallness Assumptions

Bernard Dacorogna, Sébastien Basterrechea

We discuss three types of problems. The first one involves Jacobian equations and the two others involve Hessian equations. We proceed by fixed point, obtaining the results under a smallness assumption. ...

Taylor & Francis Inc2014

Distributed Pareto Optimization via Diffusion Strategies

Ali H. Sayed

We consider solving multi-objective optimization problems in a distributed manner by a network of cooperating and learning agents. The problem is equivalent to optimizing a global cost that is the sum of individual components. The optimizers of the individ ...

IEEE2013

Fixed points and amenability in non-positive curvature

Nicolas Monod

Consider a proper cocompact CAT(0) space X. We give a complete algebraic characterisation of amenable groups of isometries of X. For amenable discrete subgroups, an even narrower description is derived, implying Q-linearity in the torsion-free case. We est ...

Springer2013

Synthesis of Fixed-Point Programs

Viktor Kuncak, Eva Darulova, Indranil Saha

Several problems in the implementations of control systems, signal-processing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixed-point arithmetic. Fixed-point arithmet ...

2013

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Martino Borello

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...

Institute of Electrical and Electronics Engineers2013

On the Generation of Precise Fixed-Point Expressions

Viktor Kuncak, Eva Darulova, Indranil Saha

2013