Sciweavers

2412 search results - page 45 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DISOPT
2011
240views Education» more  DISOPT 2011»
13 years 4 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
FOCS
2009
IEEE
14 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
BMCBI
2010
157views more  BMCBI 2010»
13 years 10 months ago
SeqTrim: a high-throughput pipeline for pre-processing any type of sequence read
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
Juan Falgueras, Antonio J. Lara, Noé Fern&a...
BIOSYSTEMS
2007
52views more  BIOSYSTEMS 2007»
13 years 10 months ago
The genotypic complexity of evolved fault-tolerant and noise-robust circuits
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...
Morten Hartmann, Pauline C. Haddow, Per Kristian L...
ICLP
2010
Springer
14 years 1 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian