Starting with a set of calibrated photographs taken of a scene, voxel coloring algorithms reconstruct three-dimensional surface models on a finite spatial domain. In this paper, we...
Gregory G. Slabaugh, Thomas Malzbender, W. Bruce C...
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelso...
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...