Shames, Iman; Bishop, Adrian
In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks.
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.