12519 search results - page 341 / 2504 » Approximation Problems Categories |
189
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
195
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
163
click to vote
MOC
2000
15 years 6 months ago
2000
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
168
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
159
click to vote
TAMC
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...