37 search results - page 5 / 8 » User-friendly matching protocol for online social networks |
160
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper, we develop an analytical framework which explains the emergence of superpeer networks on execution of the commercial peer-to-peer bootstrapping protocols by incom...
168
click to vote
WEBI
2009
Springer
16 years 19 days ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
182
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
150
click to vote
RECSYS
2009
ACM
16 years 16 days ago
2009
ACM
We propose FriendSensing, a framework that automatically suggests friends to mobile social-networking users. Using short-range technologies (e.g., Bluetooth) on her mobile phone, ...
145
click to vote
NDSS
2008
IEEE
16 years 12 days ago
2008
IEEE
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...