1041 search results - page 38 / 209 » Randomizing Reductions of Search Problems |
COCO
2008
Springer
15 years 4 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
103
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
203
click to vote
BIOCOMP
2010
15 years 7 days ago
2010
Abstract-- Modeling the intermolecular reactions in a single cell is a critical problem in computational biology. Biochemical reaction systems often involve species in both low and...
139
click to vote
WABI
2010
Springer
15 years 17 days ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
146
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...