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.
To address privacy concerns in Online Social Networks (OSNs), we propose to use a distributed, peer-to-peer approach coupled with encryption. To verify the feasibility of such an approach, we designed a two-tiered architecture and protocols that recreate t ...
The thesis is a contribution to extreme-value statistics, more precisely to the estimation of clustering characteristics of extreme values. One summary measure of the tendency to form groups is the inverse average cluster size. In extreme-value context, th ...
The internet is moving rapidly towards an interactive milieu where online communities and economies gain importance over their traditional counterparts. While this shift creates opportunities and benefits that have already improved our day-to-day life, it ...
The École Polytechnique Fédérale de Lausanne is developing a Web 2.0 social software called eLogbook and designed for sustaining interaction, collaboration, and learning in online communities. This chapter describes the 3A model on which eLogbook is based ...
Event dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every participant in the system act both as a client (information consumer) and as a server ...
The Small-World phenomenon, well known under the phrase "six degrees of separation", has been for a long time under the spotlight of investigation. The fact that our social network is closely-knitted and that any two people are linked by a short chain of a ...
Reputation is a well established means to determine trustworthiness in online systems in various contexts, e.g. online transactions, product recommendation, e-mail spam fighting, etc. However, typically these reputation systems are "closed" outside of the ...
Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...
The management of trust and quality in decentralized systems has been recognized as a key research area over recent years. In this paper, we propose a probabilistic computational approach to enable a peer in the system to model and estimate the quality and ...
This paper presents GosSkip, a self organizing and fully distributed overlay that provides a scalable support to data storage and retrieval in dynamic environments. The structure of GosSkip, while initially possibly chaotic, eventually matches a perfect se ...