3708 search results - page 9 / 742 » Approximating Betweenness Centrality |
DCG
2000
13 years 8 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— This paper presents an epipolar based visual servoing for mobile robots equipped with a panoramic camera. The proposed visual servoing is based on the epipolar geometry and exp...
APVIS
2006
13 years 10 months ago
2006
Although overcrowded and the depopulation of the population are one of the social issues in Japan, the complex mechanisms are not comprehended. Then, we tried to show this phenome...
TON
2008
13 years 8 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 ...
ICPP
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...