376 search results - page 16 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
MST
2011
13 years 2 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
ANTSW
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
CGF
1998
13 years 7 months ago
1998
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....