Leslie Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134--1142, November 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Oracles and Queries that are Sufficient for - Exact Learning Nader (Correct)
No context found.
Leslie Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
Online Performance-Improvement - Prasad Chalasani August (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, Nov. 1984.
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27, pages 1134--1142, 1984.
Journal of Machine Learning Research 7 (2006) 645--664.. - Daniil Ryabko Daniil (Correct)
No context found.
L. Valiant, A Theory of the Learnable. Communications of the ACM, 27, pp. 1134--1142. 1984.
On the Flexibility of Theoretical Models - For Pattern Recognition (Correct)
No context found.
L. Valiant, A theory of the learnable. Communications of the ACM, Vol. 27, pp.1134--1142. 1984
Detection of Interactive Stepping Stones: - Algorithms And Confidence (Correct)
No context found.
Valiant, L.: A theory of the learnable. Communications of the ACM 27 (1984) 1134--1142
Separating Distribution-Free And Mistake-Bound - Learning Models Over (Correct)
No context found.
L. G. Valiant, A theory of the learnable, Communications of the ACM, 27 (1984), pp. 1134-- 1142.
Fast Learning of k-Term DNF Formulas with Queries - Avrim Blum Carnegie (1992) (3 citations) (Correct)
No context found.
Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984. 10
Cryptographic Primitives Based on Hard - Learning Problems Avrim (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
Automatically Selecting and Using Primary Effects in Planning.. - Fink, Yang (1994) (Correct)
No context found.
Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134--1142, 1984.
Junior Barrera, Roberto M Cesar-Jr, Joo E. Ferreira, Marco D. .. - Usp Center For (Correct)
No context found.
L. G. Valiant, A theory of the learnable, Communications of ACM, 27:1134--1142, 1984.
Inductive Generalisation in Case-Based Reasoning Systems - Griffiths (1996) (1 citation) (Correct)
No context found.
L G Valiant. A theory of the learnable. Communications of the ACM, 27:1134-- 1142, 1984.
Applying Learning Algorithms to Preference Elicitation in.. - Lahaie, Parkes (2004) (4 citations) (Correct)
No context found.
Leslie Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
Marginal Boosting - Gunnar Atsch Manfred (Correct)
No context found.
L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
Explanation-Based Neural Network Learning for Robot Control - Mitchell, Thrun (1992) (22 citations) (Correct)
No context found.
Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-- 1142, 1984.
Learning DFA from Simple Examples - Rajesh Parekh Rpare (1997) (8 citations) (Correct)
No context found.
L. Valiant. A theory of the learnable. Communications of the ACM, 27:1134--1142, 1984.
The VC-Dimension of Subclasses of Pattern Languages - Mitchell, Scheffer, Sharma, .. (1999) (5 citations) (Correct)
No context found.
L. Valiant. A theory of the learnable. Communications of the ACM, 27:1134--1142, 1984.
Boosting Weak Ranking Functions to Enhance Passage.. - Usunier, Amini.. (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, 1984.
Approximate Testing of Visual Properties - Raskhodnikova (Correct)
No context found.
L. Valiant, A theory of the learnable, Communications of the ACM 27 (1984) 1134-1142
Computational Sample Complexity - Decatur, Goldreich, Ron (1998) (2 citations) (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-- 1142, November 1984.
Detection of Interactive Stepping Stones: Algorithms and .. - Blum, Song, Venkataraman (Correct)
No context found.
Valiant, L.: A theory of the learnable. Communications of the ACM 27 (1984) 1134--1142
Fast and Reliable Color Region Merging inspired by Decision Tree.. - Nock (2001) (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, pages 1134--1142, 1984.
Probabilistic Inductive Logic Programming - De Raedt, Kersting (2004) (1 citation) (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
Reinforcement Learning by Policy Search - Peshkin (2001) (7 citations) (Correct)
No context found.
L. G. Valiant, A theory of the learnable, Communications of the ACM 27 (1984), no. 11, 1134-1142.
Cryptographic Primitives Based on Hard Learning Problems - Avrim Blum Pittsburgh (1994) (27 citations) (Correct)
No context found.
L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134--1142, November 1984.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC