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.
In the recent years, researchers have investigated several methods of facial expression analysis. Their interest has been to apply their algorithms to sets of images labelled by a restrained number of experts. In order to deal with the generalizability of ...
Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...
We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...
The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...
Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to co ...
We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to co ...
We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...
In this paper, we introduce the notion of a constrained Minkowski sumwhich for two (finite) point-sets P,Q R2 and a set of k inequalities Ax b is defined as the point-set (P Q)Ax b= x = p+q | P, q Q, Ax b. We show that typical subsequ ...
Urban land-use planning and management are in constant mutation throughout the world. With sustainability as the goal, the use of indicators for land auditing and monitoring is becoming more and more in demand. Classical approaches consider the set of indi ...
