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...
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...
—Modular software, in which strongly-separated units of functionality can be independently added to and removed from a node’s running software, offers a promising approach to e...
Traffic Congestion is a multi-billion dollar national problem and worsening every year with population growth and increase in freight traffic. We present a model for realistic s...
Middleware support for pervasive context-aware systems relieves context-aware applications from dealing with the complexity of context-specific operations such as context acquisit...
Kamran Sheikh, Maarten Wegdam, Marten van Sinderen