Sciweavers

102 search results - page 1 / 21
» First Steps in Synthetic Computability Theory
Sort
View
ENTCS
2006
110views more  ENTCS 2006»
13 years 4 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
COSIT
1999
Springer
162views GIS» more  COSIT 1999»
13 years 9 months ago
Terminological Default Reasoning about Spatial Information: A First Step
We extend the theory about terminological default reasoning by using a logical base language that can represent spatioterminological phenomena. Based on this description logic lang...
Ralf Möller, Michael Wessel
VISAPP
2010
13 years 2 months ago
Inverse Problems in Imaging and Computer Vision - From Regularization Theory to Bayesian Inference
phies are also mentioned and a common mathematical abstraction for all these inverses problems will be presented. By focusing on a simple linear forward model, first a synthetic an...
Ali Mohammad-Djafari
TIP
2010
111views more  TIP 2010»
12 years 11 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
COLING
1990
13 years 6 months ago
A Computational Approach to Binding Theory
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
Alessandra Giorgi, Fabio Pianesi, Giorgio Satta