Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
This research is a study of structure and method in handwriting Thai characters for conversion and computer use. This paper covers the creation of an online handwriting recognitio...
—We present a novel algorithm to segment a 3D surface mesh into visually meaningful regions. Our approach is based on an analysis of the local geometry of vertices. In particular...
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
A new approach to Thai font type recognition that is presented in this paper is based on linear interpolation analysis of the character contour. The algorithm can perform effectiv...
A novel patch-based tessellation method for a dual subdivision scheme, the Doo-Sabin subdivision, is presented. Patch-based refinement for face-split subdivision schemes such as ...