12 search results - page 2 / 3 » On Uniform Recurrence of a Direct Product |
RSA
2008
13 years 4 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
ECCC
2006
13 years 5 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
IDA
1998
Springer
13 years 4 months ago
1998
Springer
We investigate a form of modular neural network for classification with (a) pre-separated input vectors entering its specialist (expert) networks, (b) specialist networks which ar...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--In this two-part paper, we study the design and optimization of limited feedback single-user and multiuser systems with a multiple-antenna base station and single-antenna...