The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
We investigate the use of hierarchical Gaussian shortlists to speed up Gaussian likelihood computation. This approach is a combination of hierarchical Gaussian selection and stand...
: During the last fifteen years, soft computing methods have been successfully applied in building powerful and flexible credit scoring models and have been suggested to be a possi...
-- In this paper it is explored whether personalisation of an existing computational model of attention can increase the model's validity. Computational models of attention ar...
Image registration forms the basis of many computer vision tasks. The Lucas-Kanade image registration algorithm is known to efficiently solve the sub-problem of rigid image regis...
Bernardt Duvenhage, J. P. Delport, Jason de Villie...