The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an a...
Alexander M. Bronstein, Michael M. Bronstein, Alfr...
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multi-dimensional array. Previous techniques for multi...
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
—We investigate the generalization of the Costas property in 3 or more dimensions, and we seek an appropriate definition. We offer a construction method based on the idea of res...