58 search results - page 6 / 12 » A Parallel Algorithm for Weighted Distance Transforms |
100
click to vote
HICSS
2008
IEEE
14 years 11 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
84
Voted
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
MICCAI
2008
Springer
16 years 25 days ago
2008
Springer
Abstract. Real-time parallel MRI reconstruction was demonstrated using a hybrid implementation of the TGRAPPA algorithm. The GRAPPA coefficients were calculated in k-space and appl...
175
Voted
ISCSCT
2008
IEEE
15 years 6 months ago
2008
IEEE
—To rapidly and accurately search the corresponding points along scan-lines, rectification of stereo pairs are performed so that corresponding epipolar lines are parallel to the ...