Sciweavers

499 search results - page 47 / 100
» Constructive Induction by Analogy
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 5 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
14 years 1 months ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
ALT
2008
Springer
14 years 4 months ago
Optimal Language Learning
Gold’s original paper on inductive inference introduced a notion of an optimal learner. Intuitively, a learner identifies a class of objects optimally iff there is no other lea...
John Case, Samuel E. Moelius
ACS
2011
13 years 2 months ago
Algebras of Higher Operads as Enriched Categories
Abstract. One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we begin t...
Michael Batanin, Mark Weber
ICPR
2004
IEEE
14 years 8 months ago
Grey Scale Image Skeletonisation from Noise-Damped Vector Potential
This paper describes a method for curvature dependant Skeletonisation in grey-scale images. We commence from a magnetostatic analogy, where the tangential edge flow (the cross pro...
Edwin R. Hancock, Huaijun Qiu