Sciweavers

265 search results - page 20 / 53
» A Scheme for Approximating Probabilistic Inference
Sort
View
FC
2005
Springer
97views Cryptology» more  FC 2005»
14 years 2 months ago
Probabilistic Escrow of Financial Transactions with Cumulative Threshold Disclosure
Abstract. We propose a scheme for privacy-preserving escrow of financial transactions. The objective of the scheme is to preserve privacy and anonymity of the individual user enga...
Stanislaw Jarecki, Vitaly Shmatikov
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
14 years 1 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
ICGI
1994
Springer
14 years 26 days ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 2 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
JMLR
2010
149views more  JMLR 2010»
13 years 3 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel