Sciweavers

205 search results - page 5 / 41
» On Parameterized Approximability
Sort
View
67
Voted
IMAMS
2000
65views Mathematics» more  IMAMS 2000»
14 years 11 months ago
Meshless Parameterization and B-Spline Surface Approximation
Michael S. Floater
47
Voted
AUTOMATICA
2010
76views more  AUTOMATICA 2010»
14 years 10 months ago
Approximate dynamic programming with a fuzzy parameterization
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
89
Voted
FCT
2003
Springer
15 years 3 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
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 ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
73
Voted
JDA
2007
73views more  JDA 2007»
14 years 10 months ago
Parameterized matching with mismatches
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...
Alberto Apostolico, Péter L. Erdös, Mo...