This paper addresses the problem of mapping images between different vision sensors. Such a mapping could be modeled as a sampling problem that has to encompass the change of geom...
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...