— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
In 1998, Blaze, Bleumer, and Strauss proposed an application called atomic proxy re-encryption, in which a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for...
Giuseppe Ateniese, Kevin Fu, Matthew Green, Susan ...
Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. T...
Matthew Chalmers, Marek Bell, Barry Brown, Malcolm...
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
d Abstract) Zinaida Benenson Felix G¨artner Dogan Kesdogan RWTH Aachen, Department of Computer Science, D-52056 Aachen, Germany : If the data collected within a sensor network is ...