Sciweavers

62 search results - page 13 / 13
» Model Simplification by Asymptotic Order of Magnitude Reason...
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 9 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
USS
2010
13 years 3 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...