10608 search results - page 322 / 2122 » Complexity of O'Hara's Algorithm |
148
click to vote
SIAMJO
2008
15 years 3 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...
142
click to vote
FSE
2009
Springer
15 years 10 months ago
2009
Springer
Matsui’s one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on estab...
115
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
120
click to vote
GREC
2007
Springer
15 years 7 months ago
2007
Springer
In this paper a genetic matching scheme is extended to take into account primitive arcs and complex description in the pattern recognition process. Classical ways only focus on seg...
129
click to vote
ISPE
2003
15 years 5 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...