Multi-Graph Sampling Of Online Communities Via Mean Hitting Time
Graph Chatbot
Chat with Graph Search
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.
One major concern in pervasive wireless applications is location privacy, where malicious eavesdroppers, based on static device identifiers, can continuously track users. As a commonly adopted countermeasure to prevent such identifier-based tracking, devic ...
The large-scale adoption of the Web 2.0 paradigm has revolutionized the way we interact with the Web today. End-users, so far mainly passive consumers of information are now becoming active information producers, creating, uploading, and commenting on all ...
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a partition A, B of its vertex set such that A induces a complete s-partite grap ...
Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph G a k-coloring, i.e., a partition V-1,...,V-k of the vertex set of G such that, for some specified neighborhood (N) over ...
This paper investigates context-driven flow allocation and media delivery in online social networks. We exploit information on contacts and content preferences found in social networking applications to provide efficient network services and operation at t ...
Reinforcement Learning (RL) is an approach for training agent's behavior through trial-and-error interactions with a dynamic environment. An important problem of RL is that in large domains an enormous number of decisions are to be made. Hence, instead of ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
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 ...
In today's age of digital multimedia deluge, a clear understanding of the dynamics of online communities is capital. Users have abandoned their role of passive consumers and are now the driving force behind large-scale media repositories, whose dynamics an ...
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in terms of the spectral properties of appropriate network graphs are obtained in bo ...
To better understand networking and security aspects of VANETs, we have been investigating network connectivity issues and mappings of car networks to the underlying road topology. Using this mapping and various metrics based on centrality, we locate hot-s ...
