The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
In this work we propose a novel rigid image registration approach to determine the position of high-resolution molecular structures in medium-resolution macromolecular complexes. ...
In this paper, we present a mixture Principal Component Analysis (mPCA)-based approach for voxel level quantification of dynamic positron emission tomography (PET) data in brain s...