Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
Abstract. We demonstrate the manner in which high-level design requirements, e.g., as they correspond to the commonsensical conceptualisation of expert designers, may be formally s...
Many researchers throughout the world have been struggling to better understand and describe Spatial Data Infrastructures (SDIs). Our knowledge of the real forces and mechanisms b...
— This paper is motivated by the real world problem of search and rescue by unmanned aerial vehicles (UAVs). We consider the problem of tracking a static target from a bird’sey...
Andrew Colquhoun Symington, Sonia Waharte, Simon J...
—Bandwidth demands and timing constraints are two major challenges for wireless video streaming applications. In this paper, we present a hybrid spatial/temporal retransmission p...