2944 search results - page 272 / 589 » Improving Bound Propagation |
154
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
182
Voted
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
130
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
186
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
151
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...