Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
In a previous paper [elided], we described ARTour Web Express, a software system that makes it possible to run World Wide Web applications over wide-area wireless networks. Our ea...
Henry Chang, Carl D. Tait, Norman H. Cohen, Moshe ...
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...
Abstract. In this paper, we describe an approach to activity recognition, which is based on a self-organizing, ad hoc network of body-worn sensors. It makes best use of the availab...
We present a vision of computing environments in which enterprise networks are built using untrusted public infrastructures. The vision allows for networks to dynamically change d...
Germano Caronni, S. Kumar, Christoph L. Schuba, Gl...