Sciweavers

263 search results - page 28 / 53
» Exploiting locality of interest in online social networks
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 1 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
WWW
2008
ACM
15 years 11 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
IACR
2011
123views more  IACR 2011»
13 years 10 months ago
Hummingbird: Privacy at the time of Twitter
In the last several years, micro-blogging Online Social Networks (OSNs), such as Twitter, have taken the world by storm, now boasting over 100 million subscribers. As an unparalle...
Emiliano De Cristofaro, Claudio Soriente, Gene Tsu...
SOUPS
2009
ACM
15 years 5 months ago
Social applications: exploring a more secure framework
Online social network sites, such as MySpace, Facebook and others have grown rapidly, with hundreds of millions of active users. A new feature on many sites is social applications...
Andrew Besmer, Heather Richter Lipford, Mohamed Sh...
CCR
2010
104views more  CCR 2010»
14 years 8 months ago
I know what you will do next summer
This is a brief journey across the Internet privacy landscape. After trying to convince you about the importance of the problem I will try to present questions of interest and how...
Balachander Krishnamurthy