Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
Alvaro Ruiz-Andino, Lourdes Araujo, Fernando S&aac...
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
We present an active lighting method that can control brightness of multiple objects in a scene to any values on video images. Our approach does not modify pixel values like retou...
Yoshinari Kameda, Jun Shingu, Satoshi Nishiguchi, ...
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
In this paper, we propose a new tunable index scheme, called iMinMax, that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...