Results 1  10
of
574
A Complete And Recursive Feature Theory
, 1992
"... Various feature descriptions are being employed in logic programming languages and constrainedbased grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions considered in this paper are the possibly quantified firstorder ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
order formulae obtained from a signature of binary and unary predicates called features and sorts, respectively. We establish a firstorder theory FT by means of three axiom schemes, show its completeness, and construct three elementarily equivalent models. One of the models consists of socalled feature graphs
Microkernels meet recursive virtual machines
, 1996
"... This paper describes a novel approach to providing modular and extensible operating system functionality and encapsulated environments based on a synthesis of microkernel and virtual machine concepts. We have developed a softwarebased virtualizable architecture called Fluke that allows recursive vi ..."
Abstract

Cited by 132 (27 self)
 Add to MetaCart
This paper describes a novel approach to providing modular and extensible operating system functionality and encapsulated environments based on a synthesis of microkernel and virtual machine concepts. We have developed a softwarebased virtualizable architecture called Fluke that allows recursive
BSpline Signal Processing: Part ITheory
 IEEE Trans. Signal Processing
, 1993
"... This paper describes a set of efficient filtering techniques for the processing and representation of signals in terms of continuous Bspline basis functions. We first consider the problem of determining the spline coefficients for an exact signal interpolation (direct Bspline transform). The rever ..."
Abstract

Cited by 160 (31 self)
 Add to MetaCart
techniques for signal differentiation and filtering in the transformed domain. We then derive recursive filters that efficiently solve the problems of smoothing spline and least squares approximations. The smoothing spline technique approximates a signal with a complete set of coefficients subject to certain
Towards a quantum programming language
 Mathematical Structures in Computer Science
, 2004
"... The field of quantum computation suffers from a lack of syntax. In the absence of a convenient programming language, algorithms are frequently expressed in terms of hardware circuits or Turing machines. Neither approach particularly encourages structured programming or abstractions such as data type ..."
Abstract

Cited by 166 (15 self)
 Add to MetaCart
types. In this paper, we describe the syntax and semantics of a simple quantum programming language. This language provides highlevel features such as loops, recursive procedures, and structured data types. It is statically typed, and it has an interesting denotational semantics in terms of complete
Recursive Motion and Structure Estimation with Complete Error Characterization
, 1993
"... We present an algorithm that performs recursive estimation of egomotion and ambient structure from a stream of monocular perspective images of a number of feature points. The algorithm is based on an Extended Kalman Filter (EKF) that integrates over time the instantaneous motion and structure measu ..."
Abstract

Cited by 34 (10 self)
 Add to MetaCart
We present an algorithm that performs recursive estimation of egomotion and ambient structure from a stream of monocular perspective images of a number of feature points. The algorithm is based on an Extended Kalman Filter (EKF) that integrates over time the instantaneous motion and structure
Recursion Theory I
, 2013
"... This document presents the formalization of introductory material from recursion theory — definitions and basic properties of primitive recursive functions, Cantor pairing function and computably enumerable sets (including a proof of existence of a onecomplete computably ..."
Abstract
 Add to MetaCart
This document presents the formalization of introductory material from recursion theory — definitions and basic properties of primitive recursive functions, Cantor pairing function and computably enumerable sets (including a proof of existence of a onecomplete computably
A bisimulation for type abstraction and recursion
 SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 2005
"... We present a bisimulation method for proving the contextual equivalence of packages in λcalculus with full existential and recursive types. Unlike traditional logical relations (either semantic or syntactic), our development is “elementary, ” using only sets and relations and avoiding advanced mach ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
We present a bisimulation method for proving the contextual equivalence of packages in λcalculus with full existential and recursive types. Unlike traditional logical relations (either semantic or syntactic), our development is “elementary, ” using only sets and relations and avoiding advanced
Incompatible ΩComplete Theories∗
, 2009
"... In 1985 the second author showed that if there is a proper class of measurable Woodin cardinals and V B1 and V B2 are generic extensions of V satisfying CH then V B1 and V B2 agree on all Σ21statements. In terms of the strong logic Ωlogic this can be reformulated by saying that under the above l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. For example, one can ask for recursively enumerable axioms A such that relative to large cardinal axioms ZFC +A is Ωcomplete for all of thirdorder arithmetic. Going further, for each specifiable segment Vλ of the uni
On the Integration of Recursive ALNTheories
"... Abstract. In this paper we focus on the problem of integrating knowledge bases expressed in a description logic. To this end, we propose three basic operations: union, intersection and renaming. First, the semantics of these compositional operations is studied abstracting away from implementation de ..."
Abstract
 Add to MetaCart
details. Then, we present an implementation of the proposed operations, for knowledge bases expressed in the language ALN extended with recursive definitions of concepts, which transforms compositions of knowledge bases into knowledge bases. This transformation is sound and complete with respect
Towards a Theory of Recursive Structures
 In Proceedings of 23rd International Symposium on Mathematical Foundations of Computer Science MFCS 98
, 1998
"... In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model o ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model
Results 1  10
of
574