In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
— Use of a Gaussian Sum filter (GSF) to efficiently solve the initialisation problem in bearing-only simultaneous localisation and mapping (SLAM) is the main contribution of th...
— Multicycling is a widely investigated technique for performance optimisation in behavioural synthesis. It allows an operation to execute over two or more control steps with the...
M. A. Ochoa-Montiel, Bashir M. Al-Hashimi, Peter K...