For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
As networks become all-pervasive the importance of efficient information gathering for purposes such as monitoring, fault diagnosis, and performance evaluation can only increase. E...
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Each part of a mobile robot has particular aspects of its own, which must be integrated in order to successfully conclude a specific task. Among these parts, sensing enables to co...
Luciano Oliveira, Augusto Costa, Leizer Schnitman,...
Wireless technologies are poised to bring major changes in the information infrastructure, transforming communications and facilitating information retrieval. Over the next severa...