Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Abstract. Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that cont...
Traveling to unfamiliar regions require a significant effort from novice travelers to plan where to go within a limited duration. In this paper, we propose a smart recommendation...
As a result of the recent explosion of sensor-equipped mobile phone market, the phenomenal growth of Internet and social network users, and the large deployment of sensor network i...
Interdisciplinary research from the domains of pervasive computing or ubiquitous computing, computer-human-interaction and computer science has led to the development of many intel...
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...