Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by conv...
Aboozar Ghafari, Massoud Babaie-Zadeh, Christian J...
— In this work we propose a new way to achieve visual servoing using directly the information (as defined by Shannon) of the image. A metric derived from information theory, mut...