1115 search results - page 184 / 223 » Separating Shape Graphs |
RSS
2007
13 years 10 months ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
BMCBI
2010
13 years 8 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...