AAAAAA

   
Results: 1-12 |
Results: 12
COMPLEXITY THEORETIC HARDNESS RESULTS FOR QUERY LEARNING
Authors: AIZENSTEIN H HEGEDUS T HELLERSTEIN L PITT L
Citation: H. Aizenstein et al., COMPLEXITY THEORETIC HARDNESS RESULTS FOR QUERY LEARNING, Computational complexity, 7(1), 1998, pp. 19-53
CONJUNCTIONS OF UNATE DNF FORMULAS - LEARNING AND STRUCTURE
Authors: FEIGELSON A HELLERSTEIN L
Citation: A. Feigelson et L. Hellerstein, CONJUNCTIONS OF UNATE DNF FORMULAS - LEARNING AND STRUCTURE, Information and computation, 140(2), 1998, pp. 203-228
ON THE POWER OF FINITE AUTOMATA WITH BOTH NONDETERMINISTIC AND PROBABILISTIC STATES
Authors: CONDON A HELLERSTEIN L POTTLE S WIGDERSON A
Citation: A. Condon et al., ON THE POWER OF FINITE AUTOMATA WITH BOTH NONDETERMINISTIC AND PROBABILISTIC STATES, SIAM journal on computing, 27(3), 1998, pp. 739-762
ATTRIBUTE-EFFICIENT LEARNING IN QUERY AND MISTAKE-BOUND MODELS
Authors: BSHOUTY N HELLERSTEIN L
Citation: N. Bshouty et L. Hellerstein, ATTRIBUTE-EFFICIENT LEARNING IN QUERY AND MISTAKE-BOUND MODELS, Journal of computer and system sciences (Print), 56(3), 1998, pp. 310-319
THE FORBIDDEN PROJECTIONS OF UNATE FUNCTIONS
Authors: FEIGELSON A HELLERSTEIN L
Citation: A. Feigelson et L. Hellerstein, THE FORBIDDEN PROJECTIONS OF UNATE FUNCTIONS, Discrete applied mathematics, 77(3), 1997, pp. 221-236
HOW MANY QUERIES ARE NEEDED TO LEARN
Authors: HELLERSTEIN L PILLAIPAKKAMNATT K RAGHAVAN V WILKINS D
Citation: L. Hellerstein et al., HOW MANY QUERIES ARE NEEDED TO LEARN, Journal of the ACM, 43(5), 1996, pp. 840-862
LEARNING ARITHMETIC READ-ONCE FORMULAS
Authors: BSHOUTY NH HANCOCK TR HELLERSTEIN L
Citation: Nh. Bshouty et al., LEARNING ARITHMETIC READ-ONCE FORMULAS, SIAM journal on computing, 24(4), 1995, pp. 706-735
LEARNING BOOLEAN READ-ONCE FORMULAS OVER GENERALIZED BASES
Authors: BSHOUTY NH HANCOCK TR HELLERSTEIN L
Citation: Nh. Bshouty et al., LEARNING BOOLEAN READ-ONCE FORMULAS OVER GENERALIZED BASES, Journal of computer and system sciences, 50(3), 1995, pp. 521-542
LEARNING IN THE PRESENCE OF FINITELY OR INFINITELY MANY IRRELEVANT ATTRIBUTES
Authors: BLUM A HELLERSTEIN L LITTLESTONE N
Citation: A. Blum et al., LEARNING IN THE PRESENCE OF FINITELY OR INFINITELY MANY IRRELEVANT ATTRIBUTES, Journal of computer and system sciences, 50(1), 1995, pp. 32-40
SPECIAL ISSUE ON COMPUTATIONAL LEARNING-THEORY, COLT 92 - INTRODUCTION
Authors: HELLERSTEIN L
Citation: L. Hellerstein, SPECIAL ISSUE ON COMPUTATIONAL LEARNING-THEORY, COLT 92 - INTRODUCTION, Machine learning, 17(2-3), 1994, pp. 111-114
CODING TECHNIQUES FOR HANDLING FAILURES IN LARGE DISK ARRAYS
Authors: HELLERSTEIN L GIBSON GA KARP RM KATZ RH PATTERSON DA
Citation: L. Hellerstein et al., CODING TECHNIQUES FOR HANDLING FAILURES IN LARGE DISK ARRAYS, Algorithmica, 12(2-3), 1994, pp. 182-208
FUNCTIONS THAT ARE READ-ONCE ON A SUBSET OF THEIR INPUTS
Authors: HELLERSTEIN L
Citation: L. Hellerstein, FUNCTIONS THAT ARE READ-ONCE ON A SUBSET OF THEIR INPUTS, Discrete applied mathematics, 46(3), 1993, pp. 235-251
Risultati: 1-12 |