1554 search results - page 65 / 311 » Parameterized Complexity and Approximation Algorithms |
94
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
131
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
114
Voted
CANDC
2000
ACM
15 years 2 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
192
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
124
Voted
COLT
2000
Springer
15 years 7 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...