Concept

Méthode des répliques

Publications associées (34)

On the Capacity of a Code Division Multiple Access System

We consider multiuser communication on a binary input additive white Gaussian noise channel using Randomly Spread-Code Division Multiple Access. We show concentration of various quantities of the system including the capacity and the free energy. We also o ...

2007

Spin Glass Models of Markov Random Fields

Barbara Caputo

This paper presents a novel algorithm for robust object recognition. We propose to model the visual appearance of objects via probability density functions. The algorithm consists of a fully connected Markov random field with energy function derived from r ...

2006

On the relation between MAP and BP GEXIT functions of low density parity check codes

Nicolas Macris

We consider communication over binary input memoryless symmetric channels with low density parity check codes. The relationship between maximum a posteriori and belief propagation GEXIT functions is investigated using a set of correlation inequalities of s ...

2006

Study of novel electronic conductors

Neven Barisic

This thesis presents the results of a concerted effort to understand the complex array of physical properties exhibited by the BaVS3 family of materials. As a 3d1 system, BaVS3 displays a unique collection of correlation-driven phenomena, including a metal ...

EPFL2005

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