1331 search results - page 36 / 267 » Complexity bounds for zero-test algorithms |
FCT
2003
Springer
15 years 2 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 ...
CASC
2009
Springer
15 years 4 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
SSS
2007
Springer
15 years 3 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
Transformation manifolds are quite attractive for image analysis applications that require transformation invariance properties. The geometric structure of a transformation manifo...