32 search results - page 7 / 7 » Finding the k Shortest Paths in Parallel |
SOFSEM
2000
Springer
13 years 11 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
MICCAI
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate new approaches to quantifying the white matter connectivity in the brain using Diffusion Tensor Magnetic Resonance Imaging data. Our first approach finds a...