Sciweavers

1348 search results - page 23 / 270
» Matching planar maps
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Tv-regularized Generation Of Planar Images From Omnicams
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...
IS
2006
13 years 7 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 7 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
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...
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
13 years 12 months ago
Efficient Topological Exploration
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
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 5 months ago
A Note on Solid Coloring of Pure Simplicial Complexes
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...
Joseph O'Rourke