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.
We tackle the problem of improving the relevance of automatically selected tags in large-scale ontology-based information systems. Contrary to traditional settings where tags can be chosen arbitrarily, we focus on the problem of recommending tags (e.g., co ...
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown parameter. Thus in order to support the state estimator with prior information o ...
As we live our daily lives, our surroundings know about it. Our surroundings consist of people, but also our electronic devices. Our mobile phones, for example, continuously sense our movements and interactions. This socio-geographic data could be continuo ...
Discomfort glare, among different aspects of visual discomfort is a phenomenon which is little understood and hard to quantify. As this phenomenon is dependent on the building occupant’s view direction and on the relative position of the glare source, a de ...
We present the calculation of scalar and pseudoscalar Higgs production in association with a top-antitop pair to the next-to-leading order (NLO) accuracy in QCD, interfaced with parton showers according to the MC@NLO formalism. We apply our results to the ...
In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempts or samples required to distinguish two distributions efficiently in various protocol ...
We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in under-determined linear regression problems. Given ƒ = Φα* + μ, the MUSE provably and efficiently finds a k-sparse vector α̂ such that ∥Φα̂ − ƒ∥∞ ≤ ∥ ...
We study the phase behaviour of symmetric binary mixtures of hard core Yukawa (HCY) particles via thermodynamic perturbation theory (TPT). We show that all the topologies of phase diagram reported for the symmetric binary mixtures are correctly reproduced ...
Solute transport takes place in heterogeneous porous formations, with the log conductivity, Y = ln K, modeled as a stationary random space function of given univariate normal probability density function (pdf) with mean Y, variance σY2, and integral scale ...