217 search results - page 6 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
ESA
2009
Springer
15 years 2 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
172
click to vote
RECOMB
2011
Springer
14 years 17 days ago
2011
Springer
Motivation. Current approaches to RNA structure prediction range from physics-based methods, which rely on thousands of experimentally-measured thermodynamic parameters, to machin...
ICCBR
1997
Springer
15 years 1 months ago
1997
Springer
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
FCT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...