Sciweavers

5153 search results - page 184 / 1031
» Introduction to Randomized Algorithms
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 10 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
FOCS
2002
IEEE
15 years 11 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
EMNLP
2008
15 years 8 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
VMV
2001
209views Visualization» more  VMV 2001»
15 years 7 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus