It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
This paper presents an approach for generating steering behaviors of groups of characters based on the space colonization algorithm, that has been used in the past for generating l...