Sciweavers

2292 search results - page 116 / 459
» Hierarchical approximation and localization
Sort
View
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 10 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
100
Voted
ISSAC
2005
Springer
70views Mathematics» more  ISSAC 2005»
15 years 10 months ago
Approximation of dynamical systems using s-systems theory: application to biological systems
In this article we propose a new symbolic-numeric algorithm to find positive equilibria of a n-dimensional dynamical system. This algorithm uses a symbolic manipulation of ODE in...
Laurent Tournier
ICA
2004
Springer
15 years 10 months ago
Approximate Joint Diagonalization Using a Natural Gradient Approach
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
Arie Yeredor, Andreas Ziehe, Klaus-Robert Mül...
RECOMB
1997
Springer
15 years 8 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
NIPS
2007
15 years 6 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens