AAAAAA

   
Results: 1-8 |
Results: 8
COMPUTATIONAL POWER OF NEURAL NETWORKS - A CHARACTERIZATION IN TERMS OF KOLMOGOROV COMPLEXITY
Authors: BALCAZAR JL GAVALDA R SIEGELMANN HT
Citation: Jl. Balcazar et al., COMPUTATIONAL POWER OF NEURAL NETWORKS - A CHARACTERIZATION IN TERMS OF KOLMOGOROV COMPLEXITY, IEEE transactions on information theory, 43(4), 1997, pp. 1175-1183
ORACLES AND QUERIES THAT ARE SUFFICIENT FOR EXACT LEARNING
Authors: BSHOUTY NH CLEVE R GAVALDA R KANNAN S TAMON C
Citation: Nh. Bshouty et al., ORACLES AND QUERIES THAT ARE SUFFICIENT FOR EXACT LEARNING, Journal of computer and system sciences, 52(3), 1996, pp. 421-433
BOUNDING THE COMPLEXITY OF ADVICE FUNCTIONS
Authors: GAVALDA R
Citation: R. Gavalda, BOUNDING THE COMPLEXITY OF ADVICE FUNCTIONS, Journal of computer and system sciences, 50(3), 1995, pp. 468-475
AN APPROACH TO CORRECTNESS OF DATA-PARALLEL ALGORITHMS
Authors: GABARRO J GAVALDA R
Citation: J. Gabarro et R. Gavalda, AN APPROACH TO CORRECTNESS OF DATA-PARALLEL ALGORITHMS, Journal of parallel and distributed computing, 22(2), 1994, pp. 185-201
THE QUERY COMPLEXITY OF LEARNING DFA
Authors: BALCAZAR JL DIAZ J GAVALDA R WATANABE O
Citation: Jl. Balcazar et al., THE QUERY COMPLEXITY OF LEARNING DFA, New generation computing, 12(4), 1994, pp. 337-358
STRUCTURAL-ANALYSIS OF POLYNOMIAL-TIME QUERY LEARNABILITY
Authors: WATANABE O GAVALDA R
Citation: O. Watanabe et R. Gavalda, STRUCTURAL-ANALYSIS OF POLYNOMIAL-TIME QUERY LEARNABILITY, Mathematical systems theory, 27(3), 1994, pp. 231-256
ON THE COMPUTATIONAL-COMPLEXITY OF SMALL DESCRIPTIONS
Authors: GAVALDA R WATANABE O
Citation: R. Gavalda et O. Watanabe, ON THE COMPUTATIONAL-COMPLEXITY OF SMALL DESCRIPTIONS, SIAM journal on computing, 22(6), 1993, pp. 1257-1275
A POSITIVE RELATIVIZATION OF POLYNOMIAL-TIME VERSUS POLYLOG SPACE
Authors: GAVALDA R
Citation: R. Gavalda, A POSITIVE RELATIVIZATION OF POLYNOMIAL-TIME VERSUS POLYLOG SPACE, Information processing letters, 46(3), 1993, pp. 119-123
Risultati: 1-8 |