Sciweavers

349 search results - page 12 / 70
» The Finite and the Infinite
Sort
View
SMILE
2000
Springer
14 years 1 months ago
Volumetric Warping for Voxel Coloring on an Infinite Domain
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...
ENTCS
2006
273views more  ENTCS 2006»
13 years 9 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
JCT
2006
72views more  JCT 2006»
13 years 9 months ago
Arboricity and tree-packing in locally finite graphs
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...
Maya Jakobine Stein
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 9 months ago
Edge-Magic Group Labellings of Countable Graphs
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...
CSR
2009
Springer
14 years 1 months ago
The Reachability Problem over Infinite Graphs
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...
Wolfgang Thomas