Sciweavers

802 search results - page 72 / 161
» Computational Aspects of Analyzing Social Network Dynamics
Sort
View
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
125
Voted
AAMAS
2004
Springer
15 years 1 months ago
Functional Validation in Grid Computing
The development of the World Wide Web has changed the way we think about information. Information on the web is distributed, updates are made asynchronously and resources come onli...
Guofei Jiang, George Cybenko
115
Voted
IMC
2003
ACM
15 years 7 months ago
On the correlation between route dynamics and routing loops
Routing loops are caused by inconsistencies in the routing state of the network. Although undesirable from this aspect, they can provide insight into the routing dynamics that cau...
Ashwin Sridharan, Sue B. Moon, Christophe Diot
116
Voted
ADHOCNOW
2008
Springer
15 years 8 months ago
Distributed Monitoring in Ad Hoc Networks: Conformance and Security Checking
Ad hoc networks are exposed more than traditional networks to security threats due to their mobility and open architecture aspects. In addition, any dysfunction due to badly congu...
Wissam Mallouli, Bachar Wehbi, Ana R. Cavalli
118
Voted
INFOCOM
1998
IEEE
15 years 6 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves