Sciweavers

2310 search results - page 390 / 462
» Coloring Random Graphs
Sort
View
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 2 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
GLOBECOM
2007
IEEE
14 years 2 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
Fei Xing, Wenye Wang
IPPS
2007
IEEE
14 years 2 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
ATAL
2007
Springer
14 years 2 months ago
Emergence of global network property based on multi-agent voting model
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
Kousuke Shinoda, Yutaka Matsuo, Hideyuki Nakashima
PET
2007
Springer
14 years 1 months ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja