1450 search results - page 85 / 290 » On the Complexity of Hardness Amplification |
MOBICOM
2012
ACM
11 years 11 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...
PLDI
2012
ACM
11 years 11 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...
PKC
2012
Springer
11 years 11 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,...
SIAMCOMP
2012
11 years 11 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 ...
ICIP
2001
IEEE
14 years 10 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...