Sciweavers

2479 search results - page 54 / 496
» A Computational Theory of Working Memory
Sort
View
LICS
2007
IEEE
14 years 1 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
DLOG
2007
13 years 10 months ago
A Proof Theory for DL-Lite
Abstract. In this work we propose an alternative approach to inference in DLLite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a ...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
13 years 7 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
13 years 5 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
BEHAVIOURIT
2007
91views more  BEHAVIOURIT 2007»
13 years 7 months ago
Reality is our laboratory: communities of practice in applied computer science
This paper presents a longitudinal study of the course ‘High-tech Entrepreneurship and New Media’. The course design is based on socio-cultural theories of learning and consid...
Markus Rohde, Ralf Klamma, Matthias Jarke, Volker ...