Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
For the game of Hex, we find conditions under which moves into a 4-3-2 edge template are provably inferior. H.J. van den Herik et al. (Eds.): CG 2008, LNCS 5131, pp. 229-240, 2008....
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
Since Chase and Simon presented their influential paper on perception in chess in 1973, the use of chunks has become the subject of a number of studies into the cognitive behavior ...
This paper presents a general analysis framework towards exploiting the underlying hierarchical and scalable structure of an articulated object for pose estimation and tracking. Th...
Cristian Canton-Ferrer, Josep R. Casas, Montse Par...
This paper presents a framework for view-invariant action recognition in image sequences. Feature-based human detection becomes extremely challenging when the agent is being observ...
Bhaskar Chakraborty, Marco Pedersoli, Jordi Gonz&a...
This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number...
We present a system that can segment articulated, non-rigid motion without a priori knowledge of the number of clusters present in the analyzed scenario. We combine existing algori...
Hand-gesture recognition presents a challenging problem for computer vision due to the articulated structure of the human hand and the complexity of the environments in which it is...