This article describes a novel neural network structure designed for the dynamic classiica-tion of spatio-temporal signals. The network is a two-stage structure consisting of a biologically motivated temporal encoding stage followed by a static neural classiier stage. The temporal encoding stage is based upon a simple biological learning mechanism known as habituation. This habituation based ne...

This paper examines two-stage techniques for learning kernels based on a notion of alignment. It presents a number of novel theoretical, algorithmic, and empirical results for alignmentbased techniques. Our results build on previous work by Cristianini et al. (2001), but we adopt a different definition of kernel alignment and significantly extend that work in several directions: we give a novel...

We investigate the viability of a two-stage innationary scenario in the context of super-gravity, so as to resolve the problem of initial conditions for hybrid innation. We allow for non-renormalizable terms in the superpotential and consider the most general form of the KK ahler potential and the gauge kinetic function. We construct a model with two stages of innation, the rst driven by D-term...

1 Can RhinOPlaSty Be a 2-StaGe OPeRatiOn? The idea is to inform patients with large noses, especially those with a family background of large noses, of the possibility of 2 stages of surgery. Any operation to reduce the size of the nose substantially can subject the patient to the possibility of pollybeak deformity and disappointment, followed by reconstruction of the nose with a graft, etc. I ...

We investigate the viability of a two-stage inflationary scenario in the context of supergravity, so as to resolve the problem of initial conditions for hybrid inflation. We allow for non-renormalizable terms in the superpotential and consider the most general form of the Kähler potential and the gauge kinetic function. We construct a model with two stages of inflation, the first driven by D-te...

We study the computational complexity of computing a manipulation of a two stage voting rule. An example of a two stage voting rule is Black’s procedure. The first stage of Black’s procedure selects the Condorcet winner if they exist, otherwise the second stage selects the Borda winner. In general, we argue that there is no connection between the computational complexity of manipulating the two...