Sciweavers

311 search results - page 35 / 63
» Graph Classes Between Parity and Distance-hereditary Graphs
Sort
View
SEMWEB
2001
Springer
13 years 12 months ago
Object Interoperability for Geospatial Applications
In this paper, we analyze a geospatial application for visualizing U.S. election results in order to show the problems that need to be solved in the mapping between different XML...
Isabel F. Cruz, Paul W. Calnan
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
14 years 1 months ago
Supervised Learning of Topological Maps using Semantic Information Extracted from Range Data
Abstract— This paper presents an approach to create topological maps from geometric maps obtained with a mobile robot in an indoor-environment using range data. Our approach util...
Óscar Martínez Mozos, Wolfram Burgar...
AIPS
2008
13 years 10 months ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
NC
2010
137views Neural Networks» more  NC 2010»
13 years 2 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
13 years 11 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...