The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...