Publication

Computing in Social Networks

Related publications (54)

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 Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overa ...

2012

, ,

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous 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 bui ...

2012

Spam Fighting in Social Tagging Systems

Touradj Ebrahimi, Sasan Yazdani, Ivan Ivanov

Tagging in online social networks is very popular these days, as it facilitates search and retrieval of diverse resources available online. However, noisy and spam annotations often make it difficult to perform an efficient search. Users may make mistakes ...

Springer-Verlag2012

Computing statistical measures for large databases of time series is a fundamental primitive for querying and mining time-series data [1–6]. This primitive is gaining importance with the increasing number and rapid growth of time series databases. In this ...

2012

A class of nonlinear systems and a filtration of the corresponding codistributions are presented. The filtration enjoys some strong integrability property which allows an easy computation of a linearizing normal form whenever the algorithm terminates with ...

American Institute of Physics2012

Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functional lists. We first show how to decide in NP the satisfiability problem for lo ...

2010

Multicore thermal management using approximate explicit Model Predictive Control

Giovanni De Micheli, David Atienza Alonso, Colin Neil Jones, Francesco Zanini

Meeting temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. In this paper we aim at achieving an online smooth thermal control action that minimizes the performance l ...

IEEE Press2010

Multicore thermal management using approximate explicit model predictive control

Giovanni De Micheli, David Atienza Alonso, Colin Neil Jones, Francesco Zanini

IEEE2010

Privacy-aware and highly-available OSN profiles

Karl Aberer, Rammohan Narendula

The explosive growth of online social networks (OSNs) and their wide popularity suggest the impact of OSNs on today's Internet. At the same time, concentration of vast amount of personal information within a single administrative domain causes critical pri ...

2010

Canal9: A database of political debates for analysis of social interactions

Sarah Favre, Alessandro Vinciarelli

Automatic analysis of social interactions attracts major attention in the computing community, but relatively few benchmarks are available to researchers active in the domain. This paper presents a new, publicly available, corpus of political debates inclu ...

2009