2008 |
16 | EE | Ganesh Baliga,
John Case,
Wolfgang Merkle,
Frank Stephan,
Rolf Wiehagen:
When unlearning helps.
Inf. Comput. 206(5): 694-709 (2008) |
2000 |
15 | EE | Ganesh Baliga,
John Case,
Wolfgang Merkle,
Frank Stephan:
Unlearning Helps.
ICALP 2000: 844-855 |
1999 |
14 | EE | Don C. Stone,
Seth Bergmann,
Ganesh Baliga,
A. Michael Berman,
John Schmalzel:
A CS1 maze lab, using joysticks and MIPPETs.
SIGCSE 1999: 170-173 |
13 | | Ganesh Baliga,
John Case,
Sanjay Jain:
The Synthesis of Language Learners.
Inf. Comput. 152(1): 16-43 (1999) |
1997 |
12 | | Ganesh Baliga,
Sanjay Jain,
Arun Sharma:
Learning from Multiple Sources of Inaccurate Data.
SIAM J. Comput. 26(4): 961-990 (1997) |
1996 |
11 | EE | Ganesh Baliga,
John Case,
Sanjay Jain:
Synthesizing Enumeration Techniques for Language Learning.
COLT 1996: 169-180 |
10 | | Ganesh Baliga,
Anil M. Shende:
Learning-Theoretic Perspectives of Acceptable Numberings.
Ann. Math. Artif. Intell. 17(3-4): 177-187 (1996) |
9 | | Ganesh Baliga,
John Case:
Learnability: Admissible, Co-Finite, and Hypersimple Languages.
J. Comput. Syst. Sci. 53(1): 26-32 (1996) |
1995 |
8 | | Ganesh Baliga,
John Case,
Sanjay Jain:
Language Learning with Some Negative Information.
J. Comput. Syst. Sci. 51(2): 273-285 (1995) |
1994 |
7 | | Ganesh Baliga,
John Case:
Learning with Higher Order Additional Information.
AII/ALT 1994: 64-75 |
6 | | Ganesh Baliga,
John Case,
Sanjay Jain,
Mandayam Suraj:
Machine Learning of Higher-Order Programs.
J. Symb. Log. 59(2): 486-500 (1994) |
1993 |
5 | | Ganesh Baliga,
John Case:
Learnability: Admissible, Co-finite, and Hypersimple Languages.
ICALP 1993: 289-300 |
4 | | Ganesh Baliga,
Anil M. Shende:
On Space Bounded Server Algorithms.
ICCI 1993: 77-81 |
3 | | Ganesh Baliga,
John Case,
Sanjay Jain:
Language Learning With Some Negative Information.
STACS 1993: 672-681 |
1992 |
2 | | Ganesh Baliga,
Sanjay Jain,
Arun Sharma:
Learning from Multiple Sources of Inaccurate Data.
AII 1992: 108-128 |
1 | | Ganesh Baliga,
John Case,
Sanjay Jain,
Mandayam Suraj:
Machine Learning of Higher Order Programs.
LFCS 1992: 9-20 |