13603 search results - page 309 / 2721 » On the Computational Complexity of Cut-Reduction |
166
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
190
click to vote
ICDCSW
2005
IEEE
16 years 15 days ago
2005
IEEE
Displaying and navigating complex information on wearable computers is very different from accessing the same information while sitting at your desk. Limitations in hardware, scre...
190
click to vote
RSFDGRC
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...