Sciweavers

37 search results - page 6 / 8
» User-friendly matching protocol for online social networks
Sort
View
SIGCOMM
2010
ACM
13 years 7 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
ICDCS
2009
IEEE
14 years 4 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu
JSAC
2008
111views more  JSAC 2008»
13 years 7 months ago
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Abstract--Applications involving the dissemination of information directly relevant to humans (e.g., service advertising, news spreading, environmental alerts) often rely on publis...
Paolo Costa, Cecilia Mascolo, Mirco Musolesi, Gian...
IEEECIT
2010
IEEE
13 years 6 months ago
A P2P REcommender System based on Gossip Overlays (PREGO)
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
Matteo Mordacchini, Ranieri Baraglia, Patrizio Daz...
MP
2010
119views more  MP 2010»
13 years 5 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...