Sciweavers

37 search results - page 4 / 8
» User-friendly matching protocol for online social networks
Sort
View
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
HICSS
2010
IEEE
227views Biometrics» more  HICSS 2010»
14 years 2 months ago
Do Online Reviews Reflect a Product's True Perceived Quality? - An Investigation of Online Movie Reviews Across Cultures
When does the reported average of online ratings match perceived average assessment? We apply behavioral theory to capture intentions in rating online movie reviews in two dissimi...
Noi Sian Koh, Nan Hu, Eric K. Clemons
WPES
2006
ACM
14 years 1 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...