In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
This paper addresses the problem of enabling a user of a process-centered SDE, hosted on a high-speed network, to continue working on a detached mobile workstation connected by a l...
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial da...
Laurynas Speicys, Christian S. Jensen, Augustas Kl...
A range of mobile services rely on knowing the current positions of populations of so-called moving objects. In the ideal setting, the positions of all objects are known always an...