The aim of color constancy is to remove the effect of the color of the light source. Since color constancy is inherently an ill-posed problem, different assumptions have been prop...
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...