Sciweavers

61 search results - page 2 / 13
» Probable Innocence Revisited
Sort
View
LPNMR
2005
Springer
14 years 29 days ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar
SIGOPSE
2004
ACM
14 years 26 days ago
AP3: cooperative, decentralized anonymous communication
This paper describes a cooperative overlay network that provides anonymous communication services for participating users. The Anonymizing Peer-to-Peer Proxy (AP3) system provides...
Alan Mislove, Gaurav Oberoi, Ansley Post, Charles ...
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
13 years 11 months ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
IH
2009
Springer
14 years 2 months ago
Estimating the Minimal Length of Tardos Code
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
Teddy Furon, Luis Pérez-Freire, Arnaud Guya...
ISIPTA
1999
IEEE
139views Mathematics» more  ISIPTA 1999»
13 years 11 months ago
Rational Decision Making With Imprecise Probabilities
Decision criteria based on an imprecise probability representation of uncertainty have been criticized, from the normative point of view, on the grounds that they make the decisio...
Jean-Yves Jaffray