Results 1  10
of
274,009
Linear Recursion
"... s decoration does not allow for improvement as far as reductions are concerned: all functions defined by recursion are totally intuitionistic. But some functions defined on the list data type, for example "append" or "reverse", seem to be linear in their definitions and should no ..."
Abstract
 Add to MetaCart
s decoration does not allow for improvement as far as reductions are concerned: all functions defined by recursion are totally intuitionistic. But some functions defined on the list data type, for example "append" or "reverse", seem to be linear in their definitions and should
Linear Recursive Functions
"... With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
in Turingcomplete computation models: in this paper we show that the class of partial recursive functions that are syntactically linear (that is, partial recursive functions where no argument is erased or copied) is Turingcomplete.
LINEARLY RECURSIVE SEQUENCES OF INTEGERS
"... As harmless as it may appear, the Fibonacci sequence has provoked a remarkable amount of research. It seems that there is no end to the results that may be derived from the basic definition F ^ 0 = F _,_., + F and F0 = 0 and F4 = 1, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
As harmless as it may appear, the Fibonacci sequence has provoked a remarkable amount of research. It seems that there is no end to the results that may be derived from the basic definition F ^ 0 = F _,_., + F and F0 = 0 and F4 = 1,
Linear recursive distributed representations
 Neural Netw
, 2005
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Hypothetical Datalog: Negation and Linear Recursion
 In Proceedings of the ACM Symposium on the Principles of Database Systems (PODS
, 1989
"... This paper examines an extension of Horn logic in which rules can add entries to a database hypothetically. Several researchers have developed logical systems along these lines, but the complexity and expressibility of such logics is only now being explored. It has been shown, for instance, that the ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
, that the datacomplexity of these logics is PSPACEcomplete in the functionfree, predicate case. This paper extends this line of research by developing syntactic restrictions with lower complexity. These restrictions are based on two ideas from Hornclause logic: linear recursion and stratified negation
Degreek linear recursions mod(p) . . .
, 2006
"... Linear recursions of degree k are determined by evaluating the Sequence Of Generalized Fibonacci Polynomials ..."
Abstract
 Add to MetaCart
Linear recursions of degree k are determined by evaluating the Sequence Of Generalized Fibonacci Polynomials
Statistically Linearized Recursive Least Squares
 IN PROCEEDINGS OF THE IEEE INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING (MLSP 2010), KITTILÄ (FINLAND), AUGUSTSEPTEMBER
, 2010
"... This article proposes a new interpretation of the sigmapoint kalman filter (SPKF) for parameter estimation as being a statistically linearized recursive leastsquares algorithm. This gives new insight on the SPKF for parameter estimation and particularly this provides an alternative proof for a resu ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
This article proposes a new interpretation of the sigmapoint kalman filter (SPKF) for parameter estimation as being a statistically linearized recursive leastsquares algorithm. This gives new insight on the SPKF for parameter estimation and particularly this provides an alternative proof for a
LINEAR RECURSIVE SEQUENCES AND POWERS OF MATRICES
, 1999
"... le this paper we study the properties of linear recursive sequences and give some applications to matrices. For al9 % eZ, the corresponding Lucas sequence {u„} is given by u0 = 0, ul = 1, and un+l + axun +a>2Un_i = 0 (n> 1). Such series have very interesting properties and applications, and ha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
le this paper we study the properties of linear recursive sequences and give some applications to matrices. For al9 % eZ, the corresponding Lucas sequence {u„} is given by u0 = 0, ul = 1, and un+l + axun +a>2Un_i = 0 (n> 1). Such series have very interesting properties and applications
Deadlock detection in linear recursive programs
, 1310
"... Abstract. Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursive programs of a basic model. The theory that underpins the algori ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of linear recursive programs of a basic model. The theory that underpins
Results 1  10
of
274,009