k+ decision trees - (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6451 LNCS, Issue , 2010, Pages 74-88

  Aspnes, James ^a   Blais, Eric ^b   Demirbas, Murat ^c   O'Donnell, Ryan ^b   Rudra, Atri ^c   Uurtamo, Steve ^c  

^a Yale University   (United States)

^b Carnegie Mellon University ^*  (United States)

^c State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASE STATIONS; BOOLEAN FUNCTIONS; COMPLEX NETWORKS; MOBILE AD HOC NETWORKS; WIRELESS SENSOR NETWORKS; AD HOC NETWORKS; WIRELESS AD HOC NETWORKS;

AGGREGATE FUNCTION; COMMUNICATION COMPLEXITY; DECISION TREE MODELING; EXTENDED ABSTRACTS; INTERNAL NODES; MODEL OF COMPUTATION; NATURAL GENERALIZATION; SYMMETRIC FUNCTIONS; LOWER BOUNDS;

DECISION TREES;

EID: 85037528840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16988-5_7     Document Type: Conference Paper

References (22)

1. Aigner, M.: Combinatorial Search. Wiley-Teubner Series in Computer Science (1988)
2. Arora, A., Dutta, P., Bapat, S., Kulathumani, V., Zhang, H., Naik, V., Mittal, V., Cao, H., Demirbas, M., Gouda, M., Choi, Y.R., Herman, T., Kulkarni, S.S., Arumugam, U., Nesterenko, M., Vora, A., Miyashita, M.: A line in the sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks (Elsevier) 46(5), 605-634 (2004)
3. Ben-Asher, Y., Newman, I.: Decision trees with boolean threshold queries. J. Comput. Syst. Sci. 51(3), 495-502 (1995)
4. Ben-Or, M.: Lower bounds for algebraic computation trees. In: STOC 1983, pp. 80-86 (1983)
5. Bshouty, N.H.: A subexponential exact learning algorithm for DNF using equivalence queries. Information Processing Letters" 59(3), 37-39 (1996)
6. Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: A survey. Theoretical Computer Science 288(1), 21-43 (2002)
7. Chockler, G., Demirbas, M., Gilbert, S., Lynch, N.A., Newport, C.C., Nolte, T.: Consensus and collision detectors in radio networks. Distributed Computing 21(1), 55-84 (2008)
8. Demirbas, M., Soysal, O., Hussain, M.: Singlehop collaborative feedback primitives for wireless sensor networks. In: INFOCOM, pp. 2047-2055 (2008)
9. Dobkin, D., Lipton, R.J.: Multidimensional searching problems. SIAM Journal on Computing 5(2), 181-186 (1976)
10. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)
11. Dutta, P., Musaloiu-e, R., Stoica, I., Terzis, A.: Wireless ack collisions not considered harmful. In: HotNets-VII: The Seventh Workshop on Hot Topics in Networks (2008)
12. Ehrenfeucht, A., Haussler, D.: Learning decision trees from random examples. Information and Computation 82(3), 231-246 (1989)
13. Goodrich, M.T., Hirschberg, D.S.: Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. In: SPAA 2006: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 118- 127. ACM, New York (2006)
14. Hamza, K.: The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions. Statistics and Probability Letters 23(1), 21-25 (1995)
15. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Energy-efficient size approximation of radio networks with no collision detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 279-289. Springer, Heidelberg (2002)
16. Kushilevitz, E., Mansour, Y.: Learning decision trees using the fourier spectrum. SIAM Journal on Computing 22(6), 1331-1348 (1993)
17. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
18. Moran, S., Snir, M., Manber, U.: Applications of ramsey's theorem to decision tree complexity. J. ACM 32(4), 938-949 (1985)
19. Nisan, N.: CREW PRAMs and decision trees. SIAM Journal on Computing 20(6), 999-1007 (1991)
20. Paturi, R.: On the degree of polynomials that approximate symmetric boolean functions (preliminary version). In: STOC 1992, pp. 468-474 (1992)
21. Rosenberg, A.L.: On the time required to recognize properties of graphs: a problem. SIGACT News 5(4), 15-16 (1973)
22. Yao, A.C.C.: Monotone bipartite graph properties are evasive. SIAM Journal on Computing 17(3), 517-520 (1988)