Sciweavers

53 search results - page 1 / 11
» Computing Lower Expectations with Kuznetsov's Independence C...
Sort
View
ISIPTA
2003
IEEE
13 years 10 months ago
Computing Lower Expectations with Kuznetsov's Independence Condition
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
Fabio Gagliardi Cozman
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
13 years 11 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman
IJAR
2008
78views more  IJAR 2008»
13 years 5 months ago
A survey of the theory of coherent lower previsions
This paper presents a summary of Peter Walley's theory of coherent lower previsions. We introduce three representations of coherent assessments: coherent lower and upper prev...
Enrique Miranda
INFOCOM
2012
IEEE
12 years 3 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
ASIACRYPT
2008
Springer
13 years 7 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...