International audienceWhile social networks provide news from old buddies, you can learn a lot more from people you do not know, but with whom you share many interests. We show in this paper how to build a network of anonymous social acquaintances using a gossip protocol we call Gossple, and how to leverage such a network to enhance navigation within Web 2.0 collaborative applications, à la LastFM and Delicious. Gossple nodes (users) periodically gossip digests of their interest profiles and compute their distances (in terms of interest) with respect to o...
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex i...
Milgram empirically showed that people knowing only connections to their friends could locate any pe...
Online Social Networks (OSNs), such as Facebook, provide users with tools to share information along...
International audienceWhile social networks provide news from old buddies, ...
Social networking and collaborative tagging have taken off at an unexpected scale and speed. Huge op...
International audiencehe pervasiveness of the Internet has lead research and applications to focus m...
The so-called Web 2.0 revolution has fundamentally changed the way people interact with the Internet...
The 1st Workshop on Social Networks and Distributed Systems (SNDS 2010)International audienceSocial ...
Social networking and tagging have taken off at an unex-pected scale and speed, opening huge opportu...
International audienceSocial networking and tagging have taken off at an unexpected scale and speed,...
Social networking Web sites, which allow users to create identities and link them to friends who hav...
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness ma...
3 pages, presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-...
Social networks are usually navigable small worlds: individuals are able to find short chains of acq...
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex i...
Milgram empirically showed that people knowing only connections to their friends could locate any pe...
Online Social Networks (OSNs), such as Facebook, provide users with tools to share information along...
International audienceWhile social networks provide news from old buddies, ...
Social networking and collaborative tagging have taken off at an unexpected scale and speed. Huge op...
International audiencehe pervasiveness of the Internet has lead research and applications to focus m...
The so-called Web 2.0 revolution has fundamentally changed the way people interact with the Internet...
The 1st Workshop on Social Networks and Distributed Systems (SNDS 2010)International audienceSocial ...
Social networking and tagging have taken off at an unex-pected scale and speed, opening huge opportu...
International audienceSocial networking and tagging have taken off at an unexpected scale and speed,...
Social networking Web sites, which allow users to create identities and link them to friends who hav...
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness ma...
3 pages, presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-...
Social networks are usually navigable small worlds: individuals are able to find short chains of acq...
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex i...
Milgram empirically showed that people knowing only connections to their friends could locate any pe...
Online Social Networks (OSNs), such as Facebook, provide users with tools to share information along...