4860 search results - page 177 / 972 » SNPs Problems, Complexity, and Algorithms |
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
VIS
2008
IEEE
14 years 11 months ago
2008
IEEE
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— Recent research trends and technology developments are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. ...
BIOSYSTEMS
2007
13 years 10 months ago
2007
Noise and component failure is an increasingly difficult problem in modern electronic design. Bioinspired techniques is one approach that is applied in an effort to solve such is...
ISNN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...