Sciweavers

91 search results - page 12 / 19
» The structure of super line graphs
Sort
View
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
ICRA
2002
IEEE
98views Robotics» more  ICRA 2002»
14 years 9 days ago
Sensor-Based Exploration for Convex Bodies: A New Roadmap for a Convex-Shaped Robot
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
Ji Yeong Lee, Howie Choset
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
FOCS
2008
IEEE
14 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
NAR
2011
205views Computer Vision» more  NAR 2011»
12 years 10 months ago
The BRENDA Tissue Ontology (BTO): the first all-integrating ontology of all organisms for enzyme sources
BTO, the BRENDA Tissue Ontology (http://www .BTO.brenda-enzymes.org) represents a comprehensive structured encyclopedia of tissue terms. The project started in 2003 to create a co...
Marion Gremse, Antje Chang, Ida Schomburg, Andreas...