Sciweavers

1396 search results - page 246 / 280
» Socially distributed perception
Sort
View
SIGCOMM
2009
ACM
15 years 6 months ago
CrossTalk: scalably interconnecting instant messaging networks
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
Marti A. Motoyama, George Varghese
IPPS
2008
IEEE
15 years 6 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
115
Voted
ICDM
2006
IEEE
122views Data Mining» more  ICDM 2006»
15 years 5 months ago
Latent Friend Mining from Blog Data
The rapid growth of blog (also known as “weblog”) data provides a rich resource for social community mining. In this paper, we put forward a novel research problem of mining t...
Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen
ICPP
2006
IEEE
15 years 5 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
P2P
2006
IEEE
229views Communications» more  P2P 2006»
15 years 5 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...