768 search results - page 36 / 154 » Asymptotic Cellular Complexity |
DAGSTUHL
2006
13 years 9 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
ICNSC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Complex networks have attracted much attention from various fields of sciences and engineering over the last ten years. To reveal the dynamical mechanism of synchronization in...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...