Sciweavers

37 search results - page 5 / 8
» User-friendly matching protocol for online social networks
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
How do Superpeer Networks Emerge?
—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...
Bivas Mitra, Abhishek Kumar Dubey, Sujoy Ghose, Ni...
WEBI
2009
Springer
14 years 2 months ago
Fast Matching for All Pairs Similarity Search
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...
Amit C. Awekar, Nagiza F. Samatova
KDD
2010
ACM
215views Data Mining» more  KDD 2010»
13 years 11 months ago
On the quality of inferring interests from social neighbors
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,...
Zhen Wen, Ching-Yung Lin
RECSYS
2009
ACM
14 years 2 months ago
FriendSensing: recommending friends using mobile phones
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, ...
Daniele Quercia, Licia Capra
NDSS
2008
IEEE
14 years 1 months ago
A New Privacy-Enhanced Matchmaking Protocol
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...
Ji Sun Shin, Virgil D. Gligor