1439 search results - page 2 / 288 » Fast approximation of centrality |
103
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
109
Voted
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper we present an analysis of 3D line projections for central catadioptric cameras from a projective perspective. Most algorithms consider the projection of lines as ...
80
Voted
ALENEX
2008
15 years 2 months ago
2008
80
Voted
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
61
Voted
NECO
2002
15 years 13 days ago
2002