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.
The structural refinement of the modulated phase of 4,4'-Diethoxyazoxybenzene (DXB) indicates a correlation between the shifts on the DXB molecule (modulation) and the probability to find the azoxy (N --> O) group in different configurations (disorder). Th ...
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equ ...
The aim of this tutorial is to show that, when properly formulated, probability theory is simply the science of plausible reasoning, which permits us to represent exactly and to update our state of information about the world. This is nothing new, since in ...
Decision makers use bridge management systems to determine the optimal allocation of available resources. These systems are currently focused on the structural condition of deteriorating bridges with respect to traffic loads. Bridges, however, are affected ...
The transmission of one of two messages over a binary symmetric channels with perfect and instantaneous feedback is considered. We study the situation where transmitter and receiver want to communicated reliably and quickly. We propose a simple decoding ru ...
An application to antenna optimization of bayesian network density of probability estimators is presented. This technique is very usefull for optimizations where abig number of parameters, multiple solutions and local minima increase the likelihood to conv ...
Today's computers allow us to simulate large, complex physical problems. Many times the mathematical models describing such problems are based on a relatively small amount of available information such as experimental measurements. The question arises whet ...
We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints. One of the main contributions is a novel lower bound on the sum rate, derived by generalizing Ozarow’s well-k ...
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...
An application to antenna optimization of bayesian network density of probability estimators is presented. This technique is very usefull for optimizations where abig number of parameters, multiple solutions and local minima increase the likelihood to conv ...
