A distributed deterministic approximation algorithm for data association
Published • Jun 1, 2011
NobleIDNI4P06W21R84S13
Authors:
Songhwai Oh
Abstract
The data association problem appears in many applications and is considered as the most challenging problem in intelligent systems. In this paper, we consider the Bayesian formulation of data association problems and present a deterministic polynomial-time approximation algorithm with guaranteed err...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!