Sciweavers

5075 search results - page 843 / 1015
» Convergence
Sort
View
NPL
1998
133views more  NPL 1998»
15 years 6 months ago
Parallel Coarse Grain Computing of Boltzmann Machines
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...
Julio Ortega, Ignacio Rojas, Antonio F. Día...
PAMI
2002
201views more  PAMI 2002»
15 years 6 months ago
ICP Registration Using Invariant Features
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwisecorrespondences are chosen as...
Gregory C. Sharp, Sang Wook Lee, David K. Wehe
RC
2002
72views more  RC 2002»
15 years 6 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
ROBOTICA
2002
112views more  ROBOTICA 2002»
15 years 6 months ago
Adaptation of Lowe's camera pose recovery algorithm to mobile robot self-localisation
: This paper presents an adaptation of Lowe's numerical model-based camera localisation algorithm to the domain of indoor mobile robotics. While the original method is straigh...
Omar Ait-Aider, Philippe Hoppenot, Etienne Colle
RSA
2002
99views more  RSA 2002»
15 years 6 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott