205 search results - page 5 / 41 » On Parameterized Approximability |
119
Voted
IMAMS
2000
15 years 6 months ago
2000
88
Voted
AUTOMATICA
2010
15 years 5 months ago
2010
89
Voted
CJ
2008
15 years 5 months ago
2008
149
click to vote
FCT
2003
Springer
15 years 10 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 ...
122
Voted
JDA
2007
15 years 4 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...