Results 1  10
of
289
Toward a connectionist model of recursion in human linguistic performance
 Cognitive Science
, 1999
"... Naturally occurring speech contains only a limited amount of complex recursive structure, and this is reflected in the empirically documented difficulties that people experience when processing such structures. We present a connectionist model of human performance in processing recursive language s ..."
Abstract

Cited by 170 (21 self)
 Add to MetaCart
generate such structures in a probabilistic fashion. This work suggests a novel explanation of people's limited recursive performance, without assuming the existence of a mentally represented competence grammar allowing unbounded recursion.
A powerdomain construction
 SIAM J. OF COMPUTING
, 1976
"... We develop a powerdomain construction, [.], which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains. The desire for such a construction arises when considering programming languages with nondeterministic features or p ..."
Abstract

Cited by 234 (15 self)
 Add to MetaCart
in an elementwise fashion. In the general case they are given the coarsest ordering consistent, in an appropriate sense, with the ordering given in the discrete case. We then find a restricted class of algebraic inductive partial orders which is closed under [. as well as the sum, product and exponentiation
Learning, Bottlenecks and the Evolution of Recursive Syntax
 In E. Briscoe (Ed.), Linguistic
, 1998
"... this paper. The language learning device clearly does impose constraints directly in a similar fashion  there are certain types of language that the learner simply cannot acquire  however these constraints are far less severe than those imposed by the LAD. As can be seen in the initial stages ..."
Abstract

Cited by 97 (11 self)
 Add to MetaCart
this paper. The language learning device clearly does impose constraints directly in a similar fashion  there are certain types of language that the learner simply cannot acquire  however these constraints are far less severe than those imposed by the LAD. As can be seen in the initial stages
Recursive Analysis of Linked Data Files
 IN PROCEEDINGS OF THE 1996 CENSUS BUREAU ANNUAL RESEARCH CONFERENCE
, 1996
"... This paper demonstrates a methodology for analyzing two or more files when the only common information is name and address that is subject to significant error. Such a situation might arise with lists of businesses. We assume that a small proportion of records can be accurately matched. With the mat ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
in a recursive fashion. In large measure the ideas of Neter, Maynes, and Ramanathan (1965) are revised but with new tools.
UDC 661.609.31a Method for Solving Simultaneous Helmholtz Equations
"... ABSTRACTThe method presented is ' based on a similarity transformation of the coefficients matrix allowing the transformed variables to be relaxed independently in a recursive fashion. 1. ..."
Abstract
 Add to MetaCart
ABSTRACTThe method presented is ' based on a similarity transformation of the coefficients matrix allowing the transformed variables to be relaxed independently in a recursive fashion. 1.
Recursive sparse estimation using a gaussian sum filter
 in Proceedings of the 17th IFAC World Congress, Seoul, Korea
, 2008
"... Recursive identification; Bayesian methods; Software for system identification. Abstract: We develop a recursive estimator that systematically arrives at sparse parameter estimates. The algorithm is computationally feasible for moderate parameter estimation problems and leverages the Gaussian sum f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
filter to provide both sparse parameter estimates and credible Bayesian intervals for nonzero parameters in a recursive fashion. Simulations show extremely promising accuracy, as well as a robustness not enjoyed by other sparse estimators. 1.
Routing by Distributed Recursive Computation and Information Reuse
, 1998
"... Distributed multimedia applications have qualityofservice (QoS) requirements specified in terms of constraints on various metrics such as bandwidth and delay. The task of QoS routing is to find a path from the source node to the destination node with sucient resources to support the required endt ..."
Abstract
 Add to MetaCart
toend QoS. We propose several distributed algorithms for the bandwidthconstrained routing and the delay constrained routing. The algorithms are presented in the form of distributed recursive computation (DRC). DRC computes the global routing state in a distributed, recursive fashion and often leaves
The Recursion Scheme from the Cofree Recursive Comonad
"... We instantiate the general comonadbased construction of recursion schemes for the initial algebra of a functor F to the cofree recursive comonad on F. Differently from the scheme based on the cofree comonad on F in a similar fashion, this scheme allows not only recursive calls on elements structura ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We instantiate the general comonadbased construction of recursion schemes for the initial algebra of a functor F to the cofree recursive comonad on F. Differently from the scheme based on the cofree comonad on F in a similar fashion, this scheme allows not only recursive calls on elements
RECURSIVE BIJECTIONS FOR CATALAN OBJECTS.
"... Abstract. In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions posed by R. Stanley in the addendum to his textboo ..."
Abstract
 Add to MetaCart
textbook. We actually discuss two types of bijection, one defined recursively and the other defined in a more local, relative, fashion. It is interesting to compare the results of the two. 1.
The Recursive Neural Network
, 1991
"... This paper describes a special type of dynamic neural network called the Recursive Neural Network (RNN). The RNN is a singleinput singleoutput nonlinear dynamical system with three subnets, a nonrecursive subnet and two recursive subnets. The nonrecursive subnet feeds current and previous input sa ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
samples through a multilayer perceptron with second order input units (SOMLP) [9]. In a similar fashion the two recursive subnets feed back previous output signals through SOMLPs. The outputs of the three subnets are summed to form the overall network output. The purpose of this paper is to describe
Results 1  10
of
289