We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
In this paper, we demonstrate an integrated registration and clustering algorithm to compute an atlas of fiberbundles from a set of multi-subject diffusion weighted MR images. We ...
Ulas Ziyan, Mert R. Sabuncu, W. Eric L. Grimson, C...
This poster investigates the use of Evolutionary Algorithms (EAs) to optimise solutions to the Dynamic Aircraft Landing Problem (DALP). The approach adopted here uses an EA to evo...
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
In their paper [1], Tsoi and Tan present what they call a "canonical form", which they claim to be identical to that proposed in Nerrand et al [2]. They also claim that ...