Sciweavers

27 search results - page 1 / 6
» Path bundles on n-cubes
Sort
View
TPDS
2008
67views more  TPDS 2008»
13 years 4 months ago
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
Let k 4 be even and let n 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv +fe 2n-2. We prove that ...
Iain A. Stewart, Yonghong Xiang
DM
2008
68views more  DM 2008»
13 years 5 months ago
Path bundles on n-cubes
A path bundle is a set of 2a paths in an n-cube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths form two s...
Matthew Elder
ICCV
2007
IEEE
14 years 6 months ago
Locally-Constrained Region-Based Methods for DW-MRI Segmentation
In this paper, we describe a method for segmenting fiber bundles from diffusion-weighted magnetic resonance images using a locally-constrained region based approach. From a pre-co...
John Melonakos, Marc Niethammer, Vandana Mohan, Ma...
INFOCOM
2003
IEEE
13 years 10 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
MICCAI
2009
Springer
14 years 6 months ago
Brain Connectivity Using Geodesics in HARDI
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
Mickaël Péchaud, Maxime Descoteaux, Re...