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.

A multiple birthday attack on NTRU

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU ...

Insticc-Inst Syst Technologies Information Control & Communication, Avenida D Manuel L, 27A 2 Esquerdo, Setubal, 2910-595, Portugal2008

A co-design platform for Algorithm/Architecture design exploration

Marco Mattavelli, Christophe Lucarz, Julien Dubois

The efﬁcient implementation of multimedia algorithms, for the ever increasing complexity of the speciﬁcations and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires app ...

IEEE2008

Survey Propagation Inspired Algorithms for Satisfiability

Nicolas Macris, Shrinivas Kudekar

In this note we develop generalized Survey Propagation (SP) equations from the cavity method. We quantize the message space of the messages to develop a message passing rule. We investigate a framework of greedy algorithms for finding out satisfying assign ...

2008

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007

Tracking Atoms with Particles for Audio-visual Source Localization

Pierre Vandergheynst, Andrea Cavallaro, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2007

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Low computation and low latency algorithms for distributed sensor network initialization

Volkan Cevher

In this paper, we show how an underlying system’s state vector distribution can be determined in a distributed heterogeneous sensor network with reduced subspace observability at the individual nodes. The presented algorithm can generate the initial state ...

Springer Verlag2007

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

On the Message Complexity of Indulgent Consensus

Rachid Guerraoui, Seth Gilbert

Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...

Springer2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007