3415 search results - page 343 / 683 » Lower bounds on kernelization |
158
click to vote
PODC
2006
ACM
16 years 20 days ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
160
click to vote
CEC
2005
IEEE
16 years 10 days ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
163
click to vote
FOCS
2005
IEEE
16 years 10 days ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
160
Voted
FOCS
2005
IEEE
16 years 10 days ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
205
click to vote
ASIACRYPT
2005
Springer
16 years 8 days ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...