Sciweavers

441 search results - page 1 / 89
» Betweenness centrality and resistance distance in communicat...
Sort
View
NETWORK
2010
122views more  NETWORK 2010»
13 years 5 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ECAI
2008
Springer
14 years 16 days ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
Jérôme Kunegis, Stephan Schmidt, Sahi...
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 5 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ISADS
2003
IEEE
14 years 4 months ago
The Central Guardian Approach to Enforce Fault Isolation in the Time-Triggered Architecture
This paper discusses measures to make a distributed system based on the Time-Triggered Architecture resistant to arbitrary node failures. To achieve this, the presented approach i...
Günther Bauer, Hermann Kopetz, Wilfried Stein...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 11 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...