Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Digital Communications and Networking
Research Collection School Of Computing and Information Systems
Articles 1 - 2 of 2
Full-Text Articles in Databases and Information Systems
Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang
Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang
Research Collection School Of Computing and Information Systems
With the prevalence of mobile devices that are equipped with wireless Internet capabilities and Global Positioning System (GPS) functionality, the creation and access of user-generated content are extended to users on the go. Such content are tied to real world objects, in the form of geospatial annotations, and it is only natural that these annotations are visualized using a map-based approach. However, viewing maps that are filled with annotations could hinder the serendipitous discovery of data, especially on the small screens of mobile devices. This calls for a need to manage the annotations. In this paper, we introduce a mobile …
Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis
Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …