Sciweavers

802 search results - page 104 / 161
» Computational Aspects of Analyzing Social Network Dynamics
Sort
View
LCN
2008
IEEE
14 years 3 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
SPAA
1994
ACM
14 years 24 days ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ICPP
2006
IEEE
14 years 2 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
ANTSW
2008
Springer
13 years 10 months ago
Modeling Phase Transition in Self-organized Mobile Robot Flocks
We implement a self-organized flocking behavior in a group of mobile robots and analyze its transition from an aligned state to an unaligned state. We briefly describe the robot an...
Ali Emre Turgut, Cristián Huepe, Hande &Cce...
HICSS
2008
IEEE
136views Biometrics» more  HICSS 2008»
14 years 3 months ago
The Influence of Instant Messaging Usage Behavior on Organizational Communication Satisfaction
In recent years, instant messaging (IM) has become a popular medium of online communication. While IM is expanding into the enterprise beyond personal use, it brings the convenien...
Shih-Ming Pi, Yi-Chih Liu, Tsang-Yao Chen, Shih-Hu...