1450 search results - page 85 / 290 » On the Complexity of Hardness Amplification |
203
click to vote
MOBICOM
2012
ACM
13 years 8 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
199
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
180
click to vote
PKC
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
210
click to vote
SIAMCOMP
2012
13 years 8 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
152
click to vote
ICIP
2001
IEEE
16 years 7 months ago
2001
IEEE
Various image restoration methods have been studied for removing space-variant motion blur such as iterative and POCS method. However, their computational complexity of the method...