Sciweavers

2540 search results - page 348 / 508
» Social Networks: An Introduction
Sort
View
150
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 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
16 years 2 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
111
Voted
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 2 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
CHI
2007
ACM
16 years 2 months ago
The life and death of online gaming communities: a look at guilds in world of warcraft
Massively multiplayer online games (MMOGs) can be fascinating laboratories to observe group dynamics online. In particular, players must form persistent associations or "guil...
Nicolas Ducheneaut, Nicholas Yee, Eric Nickell, Ro...
104
Voted
PERCOM
2007
ACM
16 years 1 months ago
Good Manners for Pervasive Computing--An Approach Based on the Ambient Calculus
When people interact, they follow distinct rules that coordinate the order of speech, who opens doors, whom and how to greet, and many things more. Such a social codex depends on ...
Gregor Schiele, Marcus Handte, Christian Becker