Publication

A Weighting Scheme for Enhancing Community Detection in Networks

Related publications (93)

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.

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Locating the Source of Diffusion in Large-Scale Networks

Martin Vetterli, Patrick Thiran, Pedro Pereira Correia Pinto

How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks---such as the Internet or the human social graph---it is usually infeasible to observe the state of all nodes in a network. We show that it i ...

American Physical Society2012

Practical Network Tomography

Denisa Gabriela Ghita

In this thesis, we investigate methods for the practical and accurate localization of Internet performance problems. The methods we propose belong to the field of network loss tomography, that is, they infer the loss characteristics of links from end-to-en ...

EPFL2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

A tractable analytical model for large-scale congested protein synthesis networks

Michel Bierlaire, Carolina Osorio Pizano

This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model propose ...

2012

Information Processing and Structure of Dynamical Networks

Ali Ajdari Rad

Networks are everywhere and we are confronted with many networks in our daily life. Networks such as Internet, World Wide Web, social, biological and economical networks have been subject to extensive studies in the last decade. The volume of publications ...

EPFL2011

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Distributed Dynamics on Networks and their Applications in Network Communities, Sensor Networks and EEG's

Alireza Khadivi

Coupled neural networks, the Internet, World Wide Web, social networks and interacting biological networks are few examples of systems which consist of a large number of interacting dynamical units. Collective behavior of such systems is a consequence of t ...

EPFL2011

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. W ...

2011

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

2011