1450 search results - page 121 / 290 » On the Complexity of Hardness Amplification |
RTS
2010
13 years 7 months ago
2010
Reader preference, writer preference, and task-fair reader-writer locks are shown to cause undue blocking in multiprocessor real-time systems. Phase-fair reader writer locks, a ne...
WG
2010
Springer
13 years 7 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...