Publication

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Related publications (43)

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.

Privacy and Dynamics of Social Networks

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...

EPFL2013

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Privacy and Dynamics of Social Networks (PhD Thesis: pre-print)

Pedram Pedarsani

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

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

In Tags We Trust: Trust modeling in social tagging of multimedia content

Touradj Ebrahimi, Jong Seok Lee, Ivan Ivanov, Péter Vajda

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

2012

A Decentralized Online Social Network with Efficient User-Driven Replication

Karl Aberer, Rammohan Narendula, Athanasios Papaioannou

Unprecedented growth of online social networks (OSNs) increasingly makes privacy advocates and government agencies worrisome alike. In this paper, we propose My3, a privacy-friendly decentralized alternative for online social networking. The My3 system exp ...

IEEE2012

Collaborative Personalized Top-k Processing

Rachid Guerraoui, Anne-Marie Kermarrec

This article presents P4Q, a fully decentralized gossip-based protocol to personalize query processing in social tagging systems. P4Q dynamically associates each user with social acquaintances sharing similar tagging behaviors. Queries are gossiped among s ...

Association for Computing Machinery2011

Hysteresis phenomena of a Macroscopic Fundamental Diagram in freeway networks

Nikolaos Geroliminis

Observations of traffic pairs of flow vs. density or occupancy for individual locations in freeways or arterials are usually scattered about an underlying curve. Recent observations from empirical data in arterial networks showed that in some cases by aggr ...

2011

Hysteresis Phenomena of a Macroscopic Fundamental Diagram in Freeway Networks

Nikolaos Geroliminis

Elsevier Science, Reg Sales Off, Customer Support Dept, 655 Ave Of The Americas, New York, Ny 10010 Usa2011