194 search results - page 17 / 39 » Computing Roundness is Easy if the Set is Almost Round |
100
click to vote
ASIACRYPT
2007
Springer
15 years 4 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...
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
DAC
2007
ACM
16 years 1 months ago
2007
ACM
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
108
Voted
ALGORITHMICA
2010
15 years 16 days ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
113
click to vote
TC
2010
14 years 10 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...