Sciweavers

485 search results - page 33 / 97
» Iterative Bounding LAO
Sort
View
CDC
2010
IEEE
120views Control Systems» more  CDC 2010»
15 years 2 months ago
Statistical properties of the error covariance in a Kalman filter with random measurement losses
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
Eduardo Rohr, Damián Marelli, Minyue Fu
COCOON
2009
Springer
16 years 1 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
MCU
2007
95views Hardware» more  MCU 2007»
15 years 8 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 7 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
IJBC
2010
84views more  IJBC 2010»
15 years 4 months ago
Asymptotic Values, Prepoles, and Periodic Points
Curves of parameter values for which an asymptotic value of F,(z) = 1 + e-z lies on a pre-pole of arbitrary order are found through an iterative method. Some of these curves are sh...
Jared Whitehead, Lennard Bakker