1274 search results - page 125 / 255 » New Proofs for |
154
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
115
click to vote
ASIACRYPT
2000
Springer
15 years 5 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
129
Voted
ASIAN
2006
Springer
15 years 4 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
MICCAI
2007
Springer
16 years 1 months ago
2007
Springer
In cancer treatment, understanding the aggressiveness of the tumor is essential in therapy planning and patient follow-up. In this article, we present a novel method for quantifyin...
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...