165 search results - page 9 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
102
click to vote
JMLR
2006
14 years 11 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
96
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
103
click to vote
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
118
click to vote
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...