Sciweavers

58 search results - page 8 / 12
» On Finding Acyclic Subhypergraphs
Sort
View
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
14 years 8 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen
DAGSTUHL
2006
14 years 10 months ago
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
Peter Massuthe, Karsten Wolf
CORR
2008
Springer
72views Education» more  CORR 2008»
14 years 9 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
TCBB
2008
117views more  TCBB 2008»
14 years 9 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
CVPR
2009
IEEE
16 years 4 months ago
Unsupervised Learning of Hierarchical Spatial Structures In Images
The visual world demonstrates organized spatial patterns, among objects or regions in a scene, object-parts in an object, and low-level features in object-parts. These classes o...
Devi Parikh (Carnegie Mellon University), C. Lawre...