376 search results - page 35 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
DC
2010
13 years 7 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
SIAMSC
2008
13 years 7 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...