Sciweavers

4962 search results - page 119 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
176
Voted
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 7 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 7 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
TJS
2010
89views more  TJS 2010»
15 years 4 months ago
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
Yamin Li, Shietung Peng, Wanming Chu
ISIPTA
2005
IEEE
157views Mathematics» more  ISIPTA 2005»
15 years 11 months ago
Possibilistic Networks with Locally Weighted Knowledge Bases
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
Salem Benferhat, Salma Smaoui
140
Voted
ALGOSENSORS
2010
Springer
15 years 5 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...