Recherche

Afficher tous les résultats pour

Accueil

Personne

Anne-Marie Kermarrec

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (63)

Comparing the Predictive Capability of Social and Interest Affinity for Recommendations

Karl Aberer, Anne-Marie Kermarrec, Alexandra Olteanu

The advent of online social networks created new prediction opportunities for recommender systems: instead of relying on past rating history through the use of collaborative filtering (CF), they can leverage the social relations among users as a predictor ...

Springer-Verlag Berlin2014

Privacy-Preserving Distributed Collaborative Filtering

Rachid Guerraoui, Anne-Marie Kermarrec, Davide Frey

We propose a new mechanism to preserve privacy while leveraging user profiles in distributed recommender systems. Our mechanism relies on (i) an original obfuscation scheme to hide the exact profiles of users without significantly decreasing their utility, ...

Springer International Publishing2014

Tracking freeriders in gossip-based content dissemination systems

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Kévin Clément Huguenin

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwid ...

Elsevier2014

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

WHATSUP: A Decentralized Instant News Recommender

Rachid Guerraoui, Anne-Marie Kermarrec, Davide Frey

We present WhatsUp, a collaborative filtering system for disseminating news items in a large-scale dynamic setting with no central authority. WhatsUp constructs an implicit social network based on user profiles that express the opinions of users about the ...

2013

Trust-aware peer sampling: Performance and privacy tradeoffs

Anne-Marie Kermarrec, Julien Michel Stainer, Davide Frey

The ability to identify people that share one's own interests is one of the most interesting promises of the Web 2.0 driving user-centric applications such as recommendation systems or collaborative marketplaces. To be truly useful, however, information ab ...

Elsevier Science Bv2013

Byzantine Agreement with Homonyms

Rachid Guerraoui, Eric Ruppert, Anne-Marie Kermarrec

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

Springer2013

Decentralized polling with respectable participants

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Kévin Clément Huguenin

We consider the polling problem in a social network: participants express support for a given option and expect an outcome reflecting the opinion of the majority. Individuals in a social network care about their reputation: they do not want their vote to b ...

Elsevier2012

Scalable and Secure Polling in Dynamic Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n^2) in an n nodes system, we present SPP (Secure an ...

2012

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

Boosting Gossip for Live Streaming

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Davide Frey

Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and deploy. However, whereas their probabilistic guarantees are often enough to di ...

2010

Slicing Distributed Systems

Vincent Gramoli, Anne-Marie Kermarrec

Peer-to-peer (P2P) architectures are popular for tasks such as collaborative download, VoIP telephony, and backup. To maximize performance in the face of widely variable storage capacities and bandwidths, such systems typically need to shift work from poor ...

2009

Heterogeneous Gossip

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distribut ...

Springer2009

Brief Announcement: Towards Secured Distributed Polling in Social Networks

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Kévin Clément Huguenin

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

Decentralized Polling with Respectable Participants

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Kévin Clément Huguenin

We consider the polling problem in a social network where participants care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we show that a simple s ...

2009

Stretching Gossip with Live Streaming

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Davide Frey

Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. They are also considered highly ﬂexible, namely tunable at will to increase their robustness and adapt to churn. So far however, the ...

2009

On Tracking Freeriders in Gossip Protocols

Rachid Guerraoui, Maxime Monod, Anne-Marie Kermarrec, Kévin Clément Huguenin

Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. ...

2009

Distributed Churn Measurement for Arbitrary Networks

Vincent Gramoli, Anne-Marie Kermarrec

ACM2008

SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

Vincent Gramoli, Anne-Marie Kermarrec

We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data), SONDe provides a node with a constant upper bound (h) on the number of logi ...

2008

A Fast Distributed Slicing Algorithm

Vincent Gramoli, Anne-Marie Kermarrec

ACM2008

Page 3 sur 4