We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperform...
Segmentation and tracking methods have been widely explore. However, they are often computationally heavy or require constraining assumptions. We present in this paper a new syste...
Joanna I. Olszewska, Christophe De Vleeschouwer, B...
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...
This work presents a new algorithm, called Heuristically Accelerated Q–Learning (HAQL), that allows the use of heuristics to speed up the well-known Reinforcement Learning algori...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...