780 search results - page 10 / 156 » Cost-Sharing Approximations for h |
PR
2002
14 years 10 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
70
Voted
APAL
2008
14 years 11 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
94
Voted
CCCG
2009
15 years 5 days ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
SIAMNUM
2010
14 years 5 months ago
2010
Semidiscrete finite element approximation of the linear stochastic wave equation with additive noise is studied in a semigroup framework. Optimal error estimates for the determinis...
COCOON
2001
Springer
15 years 3 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...