Sciweavers

71 search results - page 9 / 15
» Theory of Rumour Spreading in Complex Social Networks
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
HICSS
2008
IEEE
111views Biometrics» more  HICSS 2008»
14 years 2 months ago
Cooperation and Coordination in Decentralized Communication Networks
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
Devan Rosen
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
INFOCOM
2010
IEEE
13 years 6 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
INFOCOM
2009
IEEE
14 years 2 months ago
Protecting Against Network Infections: A Game Theoretic Perspective
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
Jasmina Omic, Ariel Orda, Piet Van Mieghem