The direct application of the definition of sorting in lattices [1] is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a sequence. This alternative formulation is inspired by the identity ( n k ) = ( n−1 k−1 ) + ( n−1 k ) that underlies Pascal’s triangle. It provides quadr...

In this paper, we give a re-formulation of our previously defined distillation algorithm, which can automatically transform higherorder functional programs into equivalent tail-recursive programs. Our re-formulation simplifies the presentation of the transformation and hopefully makes it easier to understand. Using distillation, it is possible to produce superlinear improvement in the run-time ...

This paper presents a new recursive formulation for computing the Walsh-Hadamard Transform (WHT) that allows the generation of higher order (longer size) 2-D WHT architectures from four lower order (shorter sizes) WHT architectures. Our methodology is based on manipulating tensor product forms so that they can be mapped directly into modular parallel architectures. The resulting WHT circuits ha...

There is now an extensive literature regarding the efficient design of incentive mechanisms in dynamic environments. Included in this literature are models with privately observed endowment shocks (Green [6], Thomas and Worrall [13], Phelan [9], Wang [15], among others), privately observed taste shocks (Atkeson and Lucas [2]) and privately observed effort levels (Spear and Srivastava [11], Phel...

ÐIn this paper, a novel method of pattern discovery is proposed. It is based on the theoretical formulation of a contingency table of events. Using residual analysis and recursive partitioning, statistically significant events are identified in a data set. These events constitute the important information contained in the data set and are easily interpretable as simple rules, contour plots, or ...

A specialized formulation of Azarbayejani and Pentland's framework for recursive recovery of motion, structure and focal length from feature correspondences tracked through an image sequence is presented. The specialized formulation addresses the case where all tracked points lie on a plane. This planarity constraint reduces the dimension of the original state vector, and consequently the numbe...

This paper introduces a new form for the Recursive Input Estimation problem. The proposed algorithm needs the inversion at each sample time of one ny×ny and one nu×nu matrices, whereas the classical formulation requires the inversion of two ny× ny matrices. Consequently, a reduction of computation time occurs in the case where ny > nu, ny being the number of measurements and nu the number of in...

Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of recursive cognitive capacities. The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, ...