In this paper we answer a question of Friedman, providing an !-separable model M of the-calculus. There therefore exists an-separable model for any 0. The model M permits no non-trivial enrichment as a partial order; neither does it permit an enrichment as a category with an initial object. The open term model embeds in M: by way of contrast we provide a model which cannot embed in any non-triv...

Following Shrager and Johnson (1995) we study growth of logical function complexity in a network swept by two overlapping waves: one of pruning, and the other of Hebbian reinforcement of connections. Results indicate a significant spatial gradient in the appearance of both linearly separable and non linearly separable functions of the two inputs of the network; the n.l.s. cells are much sparser...

This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the ef ic ient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match t o diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and u...

In this paper we present an attractive computation technique for approximating the continuous-time dual window for the Gabor signal expansion on a non-separable time-frequency lattice instead of on the traditional rectangular lattice. This non-separable lattice is described by means of a lattice generator matrix. The computation technique is based on a generalized Wexler-Raz identity and avoids...