3874 search results - page 243 / 775 » Approximation Algorithms for k-hurdle Problems |
130
click to vote
CASC
2009
Springer
15 years 11 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...
115
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
115
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
130
click to vote
ADCM
2007
15 years 4 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
127
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...