Sciweavers

776 search results - page 79 / 156
» Network Applications of Graph Bisimulation
Sort
View
CSE
2009
IEEE
14 years 4 months ago
Enabling Privacy as a Fundamental Construct for Social Networks
The current set of social networking platforms, e.g. Facebook and MySpace, has created a new class of Internet applications called social software. These systems focus on leveragi...
E. Michael Maximilien, Tyrone Grandison, Kun Liu, ...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 11 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
INFOCOM
2011
IEEE
13 years 1 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
CIKM
2009
Springer
14 years 4 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun