3875 search results - page 178 / 775 » Approximation algorithms for the 0-extension problem |
113
click to vote
ARITH
2007
IEEE
15 years 11 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
131
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
134
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
159
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
159
Voted
COCOON
2010
Springer
15 years 8 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...