메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1863-1867

Optimal ordering of transmissions for computing Boolean threshold functions

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI; DECISION PROBLEMS; DISTRIBUTED DATA; OPTIMAL COMPUTATION; OPTIMAL ORDERING; OPTIMAL STRATEGIES; SYMMETRIC BOOLEAN FUNCTIONS; THRESHOLD FUNCTIONS;

EID: 77955669072     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513431     Document Type: Conference Paper
Times cited : (4)

References (9)
  • 1
  • 4
    • 0028549029 scopus 로고
    • On communication complexity of vector-valued functions
    • R. Ahlswede and Ning Cai. On communication complexity of vector-valued functions. IEEE Transactions on Information Theory, 40:2062-2067, 1994.
    • (1994) IEEE Transactions on Information Theory , vol.40 , pp. 2062-2067
    • Ahlswede, R.1    Cai, N.2
  • 9
    • 8344230088 scopus 로고
    • On partitioning of a sample with binary-type questions in lieu of collecting observations
    • June
    • K. J. Arrow, L. Pesotchinsky, and M. Sobel. On partitioning of a sample with binary-type questions in lieu of collecting observations. Journal of the American Statistical Association, 76(374):402-409, June 1981.
    • (1981) Journal of the American Statistical Association , vol.76 , Issue.374 , pp. 402-409
    • Arrow, K.J.1    Pesotchinsky, L.2    Sobel, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.