Results 1 - 10 of 18,511

A Learning Algorithm for Continually Running Fully Recurrent Neural Networks

by Ronald J. Williams, David Zipser , 1989
"... The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a precis ..."
Abstract - Cited by 534 (4 self) - Add to MetaCart
The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks. These algorithms have: (1) the advantage that they do not require a

Contour Tracking By Stochastic Propagation of Conditional Density

by Michael Isard, Andrew Blake , 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract - Cited by 661 (23 self) - Add to MetaCart
simultaneous alternative hypotheses. Extensions to the Kalman filter to handle multiple data associations work satisfactorily in the simple case of point targets, but do not extend naturally to continuous curves. A new, stochastic algorithm is proposed here, the Condensation algorithm --- Conditional

Option pricing when underlying stock returns are discontinuous

by Robert C. Merton - Journal of Financial Economics , 1976
"... The validity of the classic Black-Scholes option pricing formula dcpcnds on the capability of investors to follow a dynamic portfolio strategy in the stock that replicates the payoff structure to the option. The critical assumption required for such a strategy to be feasible, is that the underlying ..."
Abstract - Cited by 1001 (3 self) - Add to MetaCart
stock return dynamics can be described by a stochastic process with a continuous sample path. In this paper, an option pricing formula is derived for the more-general cast when the underlying stock returns are gcncrated by a mixture of both continuous and jump processes. The derived formula has most

The synchronous dataflow programming language LUSTRE

by N. Halbwachs, P. Caspi, P. Raymond, D. Pilaud - Proceedings of the IEEE , 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems --- such as automatic control and monitoring systems --- as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract - Cited by 646 (50 self) - Add to MetaCart
in these domains (block-diagrams, networks of operators, dynamical samples-systems, etc: : : ), and its synchronous interpretation makes it well suited for handling time in programs. Moreover, this synchronous interpretation allows it to be compiled into an efficient sequential program. Finally, the Lustre

Calibrating noise to sensitivity in private data analysis

by Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, Adam Smith - In Proceedings of the 3rd Theory of Cryptography Conference , 2006
"... Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the so-called true answer is the result of applying f to the datab ..."
Abstract - Cited by 649 (60 self) - Add to MetaCart
obtain separation results showing the increased value of interactive sanitization mechanisms over non-interactive. 1 Introduction We continue a line of research initiated in [10, 11] on privacy in statistical data-bases. A statistic is a quantity computed from a sample. Intuitively, if the database is a

The Contourlet Transform: An Efficient Directional Multiresolution Image Representation

by Minh N. Do, Martin Vetterli - IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” two-dimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract - Cited by 513 (20 self) - Add to MetaCart
that is key in visual information. The main challenge in exploring geometry in images comes from the discrete nature of the data. Thus, unlike other approaches, such as curvelets, that first develop a transform in the continuous domain and then discretize for sampled data, our approach starts with a discrete

Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach

by Eckart Zitzler, Lothar Thiele - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION , 1999
"... Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a singl ..."
Abstract - Cited by 813 (22 self) - Add to MetaCart
introduce a new evolutionary approach to multicriteria optimization, the Strength Pareto EA (SPEA), that combines several features of previous multiobjective EA’s in a unique manner. It is characterized by a) storing nondominated solutions externally in a second, continuously updated population, b

The Vector Field Histogram -- Fast Obstacle Avoidance For Mobile Robots

by J. Borenstein, Y. Koren - IEEE JOURNAL OF ROBOTICS AND AUTOMATION , 1991
"... A new real-time obstacle avoidance method for mobile robots has been developed and implemented. This method, named the vector field histogram(VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses a ..."
Abstract - Cited by 484 (24 self) - Add to MetaCart
a two-dimensional Cartesian histogram gridas a world model. This world model is updated continuously with range data sampled by on-board range sensors. The VFH method subsequently employs a two-stage data-reduction process in order to compute the desired control commands for the vehicle

The Computational Brain.

by P S Churchland , T J Sejnowski , Bruce Bridgeman , 1994
"... Keywords: reductionism, neural networks, distributed coding, Karl Pribram, computational neuroscience, receptive field 1.1 The broad goal of this book, expressed at the start, is ``to understand how neurons give rise to a mental life.'' A mental reductionism is assumed in this seductively ..."
Abstract - Cited by 450 (7 self) - Add to MetaCart
Keywords: reductionism, neural networks, distributed coding, Karl Pribram, computational neuroscience, receptive field 1.1 The broad goal of this book, expressed at the start, is ``to understand how neurons give rise to a mental life.'' A mental reductionism is assumed

Real-time simultaneous localisation and mapping with a single camera

by Andrew J. Davison , 2003
"... Ego-motion estimation for an agile single camera moving through general, unknown scenes becomes a much more challenging problem when real-time performance is required rather than under the off-line processing conditions under which most successful structure from motion work has been achieved. This t ..."
Abstract - Cited by 439 (21 self) - Add to MetaCart
. This task of estimating camera motion from measurements of a continuously expanding set of selfmapped visual features is one of a class of problems known as Simultaneous Localisation and Mapping (SLAM) in the robotics community, and we argue that such real-time mapping research, despite rarely being camera
Results 1 - 10 of 18,511