1389 search results - page 39 / 278 » Improved Approximation Algorithms for Label Cover Problems |
103
click to vote
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
15 years 5 months ago
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
FCT
2003
Springer
15 years 4 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
106
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
103
click to vote
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
SCALESPACE
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...