156 search results - page 20 / 32 » On the Round Complexity of Covert Computation |
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
We are proposing a micro-architecture for highperformance IEEE floating-point addition that is based on a (non-redundant)high-radix representation of the floatingpoint operands....
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ICN
2007
Springer
14 years 1 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
ICN
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...