COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”
Publications associées (34)
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.
For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...
We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers n and k, constru ...
In this paper we address the problem of multi-object tracking in video sequences, with application to pedestrian tracking in a crowd. In this con- text, particle ¯lters provide a robust tracking framework under ambiguity conditions. The particle ¯lter tech ...
We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3--D reconstructions from monocular sequences. We formulate the tracking problem is terms of minimizing a differentiable criterion whose differenti ...
This work is concerned with the computational complexity of the recognition of \mboxLP2, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of \mboxLP2 of particular interest ...
This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...
Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...
We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evaluations in 85% of the cases for recovering the key. In this paper, w ...
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchronous robust implementations where a writer and a set of reader processes (cl ...
