Sciweavers

1763 search results - page 123 / 353
» Dependent random choice
Sort
View
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
14 years 3 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
COLT
2005
Springer
14 years 2 months ago
Martingale Boosting
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
Philip M. Long, Rocco A. Servedio
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 1 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
DNA
2001
Springer
14 years 1 months ago
The Fidelity of the Tag-Antitag System
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...
AAAI
2008
13 years 11 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...