3708 search results - page 84 / 742 » Approximating Betweenness Centrality |
103
Voted
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
91
Voted
ICIAR
2010
Springer
15 years 5 months ago
2010
Springer
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
111
Voted
CCCG
2007
15 years 2 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our techniqu...
111
Voted
ICCCN
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...