Study proposes a communication-efficient, divide and conquer algorithm that combines information from sub-machines using confidence distributions. The theoretical relationship between the number ...

Karatsuba’s divide-and-conquer multiplication algorithm takes advantage of this saving. ... For example, 12 * 21 gives the multiplications 1 * 2, 1 * 1, 2 * 2, and 2 * 1.

Abstract. This paper studies hypothesis testing and parameter estimation in the context of the divide-and-conquer algorithm. In a unified likelihood-based framework, we propose new test statistics and ...