530 search results - page 42 / 106 » Universal randomized switching |
122
click to vote
ACNS
2005
Springer
15 years 9 months ago
2005
Springer
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
143
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
123
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
130
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
126
click to vote
CPC
2002
15 years 3 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...