229 search results - page 6 / 46 » Proving Bounds on Real-Valued Functions with Computations |
CRYPTO
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
IJAR
2006
14 years 10 months ago
2006
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
STACS
2009
Springer
15 years 2 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
106
click to vote
COMGEO
2007
ACM
14 years 10 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...