Optimal ordering of transmissions for computing Boolean threshold functions

@article{Kowshik2010OptimalOO,
  title={Optimal ordering of transmissions for computing Boolean threshold functions},
  author={Hemant Kowshik and Panganamala Ramana Kumar},
  journal={2010 IEEE International Symposium on Information Theory},
  year={2010},
  pages={1863-1867}
}
We address a sequential decision problem that arises in the computation of symmetric Boolean functions of distributed data. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we wish to compute a given Boolean function of these measurements. We suppose that the measurements are independent and Bernoulli distributed. Thus, the problem of optimal computation becomes the problem of optimally ordering nodes… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Nisan.Communication Complexity

  • N. E. Kushilevitz
  • 1997
2 Excerpts

On partitioni ng of a sample with binary-type questions in lieu of collecting observati ons

  • K. J. Arrow, L. Pesotchinsky, M. Sobel
  • Journal of the American Statistical Association…
  • 1981
1 Excerpt

Similar Papers

Loading similar papers…