Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Chinese NE (Named Entity) recognition is a difficult problem because of the uncertainty in word segmentation and flexibility in language structure. This paper proposes the use of ...
This paper proposes a design for the optimized dynamic (re)composition of services that supports various user requests and accounts for changes in user`s context. The composition ...
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
In this paper, we propose a novel routing algorithm for maritime monitoring of short term events where large area monitoring relies on small buoys drifting along with local curren...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...