Results 1  10
of
2,815
Recursive Solutions of the Matrix Equations
"... Two classes of recursive algorithms for computing the extreme solutions of the matrix equations X+ATX−1A = Q and X−ATX−1A = Q are presented. The Per Step Algorithms are based on the fixed point iteration method and its variations; the proposed Per Step Algorithm is an inversion free variant of the ..."
Abstract
 Add to MetaCart
Two classes of recursive algorithms for computing the extreme solutions of the matrix equations X+ATX−1A = Q and X−ATX−1A = Q are presented. The Per Step Algorithms are based on the fixed point iteration method and its variations; the proposed Per Step Algorithm is an inversion free variant
FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem
 In Proceedings of the AAAI National Conference on Artificial Intelligence
, 2002
"... The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filterbase ..."
Abstract

Cited by 599 (10 self)
 Add to MetaCart
based algorithms, for example, require time quadratic in the number of landmarks to incorporate each sensor observation. This paper presents FastSLAM, an algorithm that recursively estimates the full posterior distribution over robot pose and landmark locations, yet scales logarithmically with the number
An Introduction to the Kalman Filter
 UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL
, 1995
"... In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area o ..."
Abstract

Cited by 1146 (13 self)
 Add to MetaCart
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area
TimeRecursive Solution to the Inverse Problem of Electrocardiography
"... This paper presents a new approach to the estimation of epicardial potentials from measured body surface potentials. This problem is illposed, and regularization techniques, through incorporation of a priori information on the solution, provide an efficient way of improving the quality of the estim ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a new approach to the estimation of epicardial potentials from measured body surface potentials. This problem is illposed, and regularization techniques, through incorporation of a priori information on the solution, provide an efficient way of improving the quality
A recursive solution concept for multichoice games
, 2007
"... Abstract. We propose a new axiomatization of the Shapley value for cooperative games, where symmetry and efficiency can be discarded and replaced with new natural axioms. From any game, an excludedplayer game is built by discarding all coalitions that contain a fixed player. Then it is shown that t ..."
Abstract
 Add to MetaCart
Abstract. We propose a new axiomatization of the Shapley value for cooperative games, where symmetry and efficiency can be discarded and replaced with new natural axioms. From any game, an excludedplayer game is built by discarding all coalitions that contain a fixed player. Then it is shown that the Shapley value is the unique value satisfying the linearity axiom, the nullity axiom, the excludednullplayer axiom, and the equity axiom. In the second part, by generalizing the above material, the Shapley value for multichoice games is worked out. Key words. Shapley value, multichoice games, equity, generalized nullity axiom. 1
Recursive Solution Methods for Dynamic Linear Rational Expectations Models
 Journal of Econometrics
, 1989
"... This paper develops recursive solution methods for linear rational expectations models. The underlying structural model is transformed into a statespace representation, which can then be used to solve the model and to form the Gaussian likelihood function. The recursive solution method has several ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
This paper develops recursive solution methods for linear rational expectations models. The underlying structural model is transformed into a statespace representation, which can then be used to solve the model and to form the Gaussian likelihood function. The recursive solution method has several
Recursive Solutions for Discrete Time Queues with Applications to High Speed Switching Fabrics
, 1992
"... Fast recursive solutions for the equilibrium state probabilities of discrete time queuing systems are presented. A form of boundary balancing is used to arrive at their solutions. Cases examined include the Geom/Geom/K/N queue, a queue with a varying number of servers and the Manhattan Street metro ..."
Abstract
 Add to MetaCart
Fast recursive solutions for the equilibrium state probabilities of discrete time queuing systems are presented. A form of boundary balancing is used to arrive at their solutions. Cases examined include the Geom/Geom/K/N queue, a queue with a varying number of servers and the Manhattan Street metro
Estimation of probabilities from sparse data for the language model component of a speech recognizer
 IEEE Transactions on Acoustics, Speech and Signal Processing
, 1987
"... AbstractThe description of a novel type of rngram language model is given. The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data. This solution compares favorably to other proposed methods. Wh ..."
Abstract

Cited by 799 (2 self)
 Add to MetaCart
AbstractThe description of a novel type of rngram language model is given. The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data. This solution compares favorably to other proposed methods
Recursive Solution of Heisenberg's Equation and its Interpretation
 J. Phys. CM
, 1994
"... We present the generalization of the recursion method of Haydock, Heine and Kelly[J. Phys. C 5, 2845 (1972)] to systems of many interacting particles. This new method has close similarities to the memory function or Mori formalism, but with some important differences. Heisenberg’s equation for the t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present the generalization of the recursion method of Haydock, Heine and Kelly[J. Phys. C 5, 2845 (1972)] to systems of many interacting particles. This new method has close similarities to the memory function or Mori formalism, but with some important differences. Heisenberg’s equation
On Degeneracy of Eigenvalues and Recursive Solution of Symmetrically Coupled Dynamic Systems
"... ' flow cases. For no radial flow, the entire cavity becomes what miehl be termed a single toroidal vortex cell, and this situation , s j K  K for small negative values of the radial Reynolds number. TTowcver, this phenomenon disappears as the radial inflow is increased as can be seen in Fina ..."
Abstract
 Add to MetaCart
will give a value of the lowest frequency that deviates from the exact one by less than I percent if n ^ 6; i.e., The illustrative example presented in the paper can be solved directly and exactly by expansion of the determinant and solution of the secular equation, thus: Author's Closure The writer
Results 1  10
of
2,815