In recent years, the large deployment of mobile devices has led to a massive increase in the volume of records of where people have been and when they were there. The analysis of t...
Fabien Girardin, Filippo Dal Fiore, Carlo Ratti, J...
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
— As the cost of embedded sensors and actuators drops, new applications will arise that exploit high density networks of small devices capable of a variety of sensing tasks. Alth...
Lewis Girod, Vladimir Bychkovskiy, Jeremy Elson, D...
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
Abstract. The decoupling between behavior and communication fostered by coordination becomes of paramount importance in mobile computing. In this scenario, however, coordination te...