Sciweavers

736 search results - page 46 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
DAM
2007
88views more  DAM 2007»
13 years 7 months ago
Digital planarity - A review
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...
RTA
2005
Springer
14 years 1 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
CVPR
2001
IEEE
14 years 9 months ago
Affine Arithmetic Based Estimation of Cue Distributions in Deformable Model Tracking
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
Siome Goldenstein, Christian Vogler, Dimitris N. M...
MASCOTS
2008
13 years 9 months ago
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications
Galois field implementations are central to the design of many reliable and secure systems, with many systems implementing them in software. The two most common Galois field opera...
Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Sc...
MLQ
1998
61views more  MLQ 1998»
13 years 7 months ago
Extracting Algorithms from Intuitionistic Proofs
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
Fernando Ferreira, António Marques