Sciweavers

COMGEO
2010
ACM
13 years 6 months ago
Computing the visibility map of fat objects
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 ...
Mark de Berg, Chris Gray
CIE
2010
Springer
13 years 6 months ago
Proofs, Programs, Processes
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...
Ulrich Berger, Monika Seisenberger
UIC
2010
Springer
13 years 7 months ago
A Lattice-Theoretic Approach to Runtime Property Detection for Pervasive Context
Abstract. Runtime detection of contextual properties is one of the primary approaches to enabling context-awareness. Existing property detection schemes implicitly assume that cont...
Tingting Hua, Yu Huang 0002, Jiannong Cao, XianPin...
UIC
2010
Springer
13 years 7 months ago
Smart Itinerary Recommendation Based on User-Generated GPS Trajectories
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...
Hyoseok Yoon, Yu Zheng, Xing Xie, Woontack Woo
UIC
2010
Springer
13 years 7 months ago
Extracting Social and Community Intelligence from Digital Footprints: An Emerging Research Area
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...
Daqing Zhang, Bin Guo, Bin Li, Zhiwen Yu
UIC
2010
Springer
13 years 7 months ago
A Middleware for Intelligent Environments and the Internet of Things
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...
Luis Roalter, Matthias Kranz, Andreas Möller
TAMC
2010
Springer
13 years 7 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
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...
Pinar Heggernes, Daniel Meister, Udi Rotics
TAMC
2010
Springer
13 years 7 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
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...
Johannes Uhlmann, Mathias Weller
SOFTWARE
2010
13 years 7 months ago
Managing Variability in Software Product Lines
Muhammad Ali Babar, Lianping Chen, Forrest Shull
SOFTWARE
2010
13 years 7 months ago
Telling Our Stories
Linda Rising