2944 search results - page 29 / 589 » Improving Bound Propagation |
FSE
2010
Springer
13 years 11 months ago
2010
Springer
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
CCCG
2008
13 years 9 months ago
2008
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
COCOON
2007
Springer
14 years 1 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...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
IOR
2008
13 years 7 months ago
2008
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...