Sciweavers

2492 search results - page 89 / 499
» False-Name-Proofness in Social Networks
Sort
View
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
SIGCOMM
2010
ACM
13 years 8 months ago
The little engine(s) that could: scaling online social networks
The difficulty of scaling Online Social Networks (OSNs) has introduced new system design challenges that has often caused costly re-architecting for services like Twitter and Face...
Josep M. Pujol, Vijay Erramilli, Georgos Siganos, ...
ANTSW
2006
Springer
13 years 11 months ago
Communication, Leadership, Publicity and Group Formation in Particle Swarms
In this paper we look at how the structure of the social network and the nature of the social interactions can affect the behaviour of particle swarms. To this end, we create and ...
Riccardo Poli, William B. Langdon, Paul Marrow, Ja...
ACMACE
2009
ACM
14 years 18 days ago
Familiars: representing Facebook users' social behaviour through a reflective playful experience
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
Ben Kirman, Eva Ferrari, Shaun Lawson, Jonathan Fr...
CHI
2009
ACM
14 years 8 months ago
Design and adoption of social collaboration software within businesses
Social networking and collaboration sites are having a large impact on people's personal lives. These same applications, similar functions and related experiences are being a...
Jason Blackwell, John Sheridan, Keith Instone, Dav...