Concept

Inégalité arithmético-géométrique

Publications associées (28)

Obstacles For Splitting Multidimensional Necklaces

The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)

Amer Mathematical Soc2015

Computation Over Gaussian Networks With Orthogonal Components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum f ...

Institute of Electrical and Electronics Engineers2014

Impact of the apolipoprotein E polymorphism, age and sex on neurogenesis in mice: Pathophysiological relevance for Alzheimer's disease?

Johan Auwerx

Apolipoprotein E (ApoE) is found in three different forms in humans (ApoE2, ApoE3 and ApoE4), and ApoE polymorphism is recognized as a major risk factor for Alzheimer's disease (AD). ApoE is involved in lipid and cholesterol transport, cell repair, and amy ...

Elsevier2014

Computation over Gaussian networks with orthogonal components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation of arbitrarily correlated discrete sources over Gaussian networks with multiple access components but no broadcast is studied. Two classes of functions are considered: the arithmetic sum function and the frequency histogram function. T ...

2013

Transformation-Invariant Analysis of Visual Signals with Parametric Models

Elif Vural

The analysis of collections of visual data, e.g., their classification, modeling and clustering, has become a problem of high importance in a variety of applications. Meanwhile, image data captured in uncontrolled environments by arbitrary users is very li ...

EPFL2013

Optimization Problem Coupled with Differential Equations: A Numerical Algorithm Mixing an Interior-Point Method and Event Detection

Jacques Rappaz, Alexandre Caboussat, Christian Landry

The numerical analysis of a dynamic constrained optimization problem is presented. It consists of a global minimization problem that is coupled with a system of ordinary differential equations. The activation and the deactivation of inequality constraints ...

2010

Universal Bounds And Semiclassical Estimates For Eigenvalues Of Abstract Schrodinger Operators

Joachim Stubbe

We prove trace inequalities for a self-adjoint operator on an abstract Hilbert space, which extend those known previously for Laplacians and Schrodinger operators, freeing them from restrictive assumptions on the nature of the spectrum and allowing operato ...

2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

Julien Houriet

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

Rating aggregation in collaborative filtering systems

Boi Faltings, Radu Jurca, Florent Frédéric Garcin, Nadine Joswig

Recommender systems based on user feedback rank items by aggregating users' ratings in order to select those that are ranked highest. Ratings are usually aggregated using a weighted arithmetic mean. However, the mean is quite sensitive to outliers and bias ...

ACM Press2009

Isometry groups of non-positively curved spaces: Discrete subgroups

Nicolas Monod

We study lattices in non-positively curved metric spaces. Borel density is established in that setting as well as a form of Mostow rigidity. A converse to the flat torus theorem is provided. Geometric arithmeticity results are obtained after a detour throu ...

2009

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