Full Name
Sanjay Jain
Variants
Jain, Sanjay
Jain S
Jain, S.
 
 
 
Email
dcsjains@nus.edu.sg
 

Publications

Results 101-120 of 161 (Search time: 0.011 seconds).

Issue DateTitleAuthor(s)
1012008Numberings optimal for learningJain, S. ; Stephan, F. 
1021999On a generalized notion of mistake boundsJain, Sanjay ; Sharma, Arun
1032001On a generalized notion of mistake boundsJain, S. ; Sharma, A.
10413-Jan-1995On a question about learning nearly minimal programsJain, S. 
1051999On a question of nearly minimal identification of functionsJain, S. 
1069-Jan-1995On aggregating teams of learning machinesJain, S. ; Sharma, A.
1072001On an open problem in classification of languagesJain, S. 
1082013On conservative learning of recursively enumerable languagesGao, Z.; Jain, S. ; Stephan, F. 
92006On learning languages from positive data and a limited number of short counterexamplesJain, S. ; Kinber, E.
104-Apr-2003On learning of functions refutablyJain, S. ; Kinber, E.; Wiehagen, R.; Zeugmann, T.
112003On learning to coordinate random bits help, insightful normal forms, and competency isomorphismsCase, J.; Jain, S. ; Montagna, F.; Simi, G.; Sorbi, A.
122005On learning to coordinate: Random bits help, insightful normal forms, and competency isomorphismsCase, J.; Jain, S. ; Montagna, F.; Simi, G.; Sorbi, A.
132009On some open problems in monotonic and conservative learningJain, S. 
142009On some open problems in reflective inductive inferenceJain, S. 
152012On the amount of nonconstructivity in learning formal languages from positive dataJain, S. ; Stephan, F. ; Zeugmann, T.
162003On the intrinsic complexity of learning recursive functionsJain, S. ; Kinber, E.; Papazian, C.; Smith, C.; Wiehagen, R.
172001On the learnability of recursively enumerable languages from good examplesJain, S. ; Lange, S.; Nessel, J.
1820-Aug-1993On the non-existence of maximal inference degrees for language identificationJain, S. ; Sharma, A.
191998On the power of learning robustlyJain, Sanjay ; Smith, Carl; Wiehagen, Rolf
202007One-shot learners using negative counterexamples and nearest positive examplesJain, S. ; Kinber, E.