1449 search results - page 118 / 290 » Self-Randomized Exponentiation Algorithms |
156
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
220
click to vote
PLANX
2008
15 years 7 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
201
click to vote
TRIER
2002
15 years 6 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
182
click to vote
ICAI
2010
15 years 4 months ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
176
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...