The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...