1439 search results - page 4 / 288 » Fast approximation of centrality |
NETWORKING
2008
13 years 11 months ago
2008
The decentralized control scheme for routing in current IP networks has been questioned, and a centralized control scheme has been proposed. In this paper, we compare the convergen...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— This paper presents a parametric approach for tracking piecewise planar scenes with central catadioptric cameras (including perspective cameras). We extend the standard notion ...
AMC
2007
13 years 10 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
TON
2008
13 years 9 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
FAW
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...