| 2008 |
|---|
| 85 | EE | Janis Barzdins,
Rusins Freivalds,
Carl H. Smith:
Learning with belief levels.
J. Comput. Syst. Sci. 74(4): 527-545 (2008) |
| 2003 |
|---|
| 84 | EE | Sanjay Jain,
Efim B. Kinber,
Christophe Papazian,
Carl H. Smith,
Rolf Wiehagen:
On the intrinsic complexity of learning recursive functions.
Inf. Comput. 184(1): 45-70 (2003) |
| 2002 |
|---|
| 83 | | Steffen Lange,
Ken Satoh,
Carl H. Smith:
Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings
Springer 2002 |
| 82 | EE | Rusins Freivalds,
Carl H. Smith:
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications.
LATIN 2002: 386-399 |
| 81 | | Carl H. Smith:
Letter to the Editor.
AI Magazine 23(4): 4 (2002) |
| 80 | | Brian Postow,
Kenneth W. Regan,
Carl H. Smith:
UPSILON: Universal Programming System with Incomplete Lazy Object Notation.
Fundam. Inform. 50(3-4): 325-359 (2002) |
| 79 | EE | Rusins Freivalds,
Marek Karpinski,
Carl H. Smith,
Rolf Wiehagen:
Learning by the Process of Elimination.
Inf. Comput. 176(1): 37-50 (2002) |
| 2001 |
|---|
| 78 | EE | Janis Barzdins,
Rusins Freivalds,
Carl H. Smith:
Towards Axiomatic Basis of Inductive Inference.
FCT 2001: 1-13 |
| 77 | | Sanjay Jain,
Carl H. Smith,
Rolf Wiehagen:
Robust Learning Is Rich.
J. Comput. Syst. Sci. 62(1): 178-212 (2001) |
| 76 | | Stuart A. Kurtz,
Carl H. Smith,
Rolf Wiehagen:
On the role of search for learning from examples.
J. Exp. Theor. Artif. Intell. 13(1): 25-43 (2001) |
| 75 | EE | Andris Ambainis,
Kalvis Apsitis,
Rusins Freivalds,
Carl H. Smith:
Hierarchies of probabilistic and team FIN-learning.
Theor. Comput. Sci. 261(1): 91-117 (2001) |
| 2000 |
|---|
| 74 | EE | D. S. Tomer,
Doug Baldwin,
Carl H. Smith,
Peter B. Henderson,
Venu Vadisigi:
CS1 and CS2 (panel session): foundations of computer science and discrete mathematics.
SIGCSE 2000: 397-398 |
| 1999 |
|---|
| 73 | EE | Efim B. Kinber,
Christophe Papazian,
Carl H. Smith,
Rolf Wiehagen:
On the Intrinsic Complexity of Learning Recursive Functions.
COLT 1999: 257-266 |
| 72 | | Andris Ambainis,
Rusins Freivalds,
Carl H. Smith:
Inductive Inference with Procrastination: Back to Definitions.
Fundam. Inform. 40(1): 1-16 (1999) |
| 71 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
The functions of finite support: a canonical learning problem.
J. Exp. Theor. Artif. Intell. 11(4): 543-552 (1999) |
| 70 | EE | Kalvis Apsitis,
Setsuo Arikawa,
Rusins Freivalds,
Eiju Hirowatari,
Carl H. Smith:
On the Inductive Inference of Recursive Real-Valued Functions.
Theor. Comput. Sci. 219(1-2): 3-17 (1999) |
| 1998 |
|---|
| 69 | | Michael M. Richter,
Carl H. Smith,
Rolf Wiehagen,
Thomas Zeugmann:
Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings
Springer 1998 |
| 68 | EE | Michael M. Richter,
Carl H. Smith,
Rolf Wiehagen,
Thomas Zeugmann:
Editor's Introduction.
ALT 1998: 1-10 |
| 67 | EE | Sanjay Jain,
Carl H. Smith,
Rolf Wiehagen:
On the Power of Learning Robustly.
COLT 1998: 187-197 |
| 66 | EE | Janis Barzdins,
Rusins Freivalds,
Carl H. Smith:
A Logic of Discovery.
Discovery Science 1998: 401-402 |
| 65 | EE | Lance Fortnow,
Rusins Freivalds,
William I. Gasarch,
Martin Kummer,
Stuart A. Kurtz,
Carl H. Smith,
Frank Stephan:
On the Relative Sizes of Learnable Sets.
Theor. Comput. Sci. 197(1-2): 139-156 (1998) |
| 1997 |
|---|
| 64 | | Andris Ambainis,
Kalvis Apsitis,
Rusins Freivalds,
William I. Gasarch,
Carl H. Smith:
Team Learning as a Game.
ALT 1997: 2-17 |
| 63 | EE | Kalvis Apsitis,
Rusins Freivalds,
Carl H. Smith:
Asymmetric Team Learning.
COLT 1997: 90-95 |
| 62 | | Janis Barzdins,
Rusins Freivalds,
Carl H. Smith:
Learning Formulae from Elementary Facts.
EuroCOLT 1997: 272-285 |
| 61 | | Rusins Freivalds,
Gints Tervits,
Rolf Wiehagen,
Carl H. Smith:
Learning Small Programs with Additional Information.
LFCS 1997: 102-112 |
| 60 | | Carl H. Smith,
Rolf Wiehagen,
Thomas Zeugmann:
Classifying Predicates and Languages.
Int. J. Found. Comput. Sci. 8(1): 15- (1997) |
| 1996 |
|---|
| 59 | | Janis Barzdins,
Rusins Freivalds,
Carl H. Smith:
Learning with Confidence.
STACS 1996: 207-218 |
| 58 | | Andris Ambainis,
Rusins Freivalds,
Carl H. Smith:
General Inductive Inference Types Based on Linearly-Ordered Sets.
STACS 1996: 243-253 |
| 57 | | Kalvis Apsitis,
Rusins Freivalds,
Carl H. Smith:
On Duality in Learning and the Selection of Learning Terms.
Inf. Comput. 129(1): 53-62 (1996) |
| 1995 |
|---|
| 56 | EE | Kalvis Apsitis,
Rusins Freivalds,
Carl H. Smith:
On the Inductive Inference of Real Valued Functions.
COLT 1995: 170-177 |
| 55 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the intrinsic complexity of learning.
EuroCOLT 1995: 154-168 |
| 54 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
Probabilistic versus Deterministic Memory Limited Learning.
GOSLER Final Report 1995: 155-161 |
| 53 | | Rolf Wiehagen,
Carl H. Smith,
Thomas Zeugmann:
Classifying Recursive Predicates and Languages.
GOSLER Final Report 1995: 174-189 |
| 52 | | Lance Fortnow,
Rusins Freivalds,
William I. Gasarch,
Martin Kummer,
Stuart A. Kurtz,
Carl H. Smith,
Frank Stephan:
Measure, Category and Learning Theory.
ICALP 1995: 558-569 |
| 51 | | Carl H. Smith,
William I. Gasarch:
Recursion Theoretic Models of Learning: Some Results and Intuitions.
Ann. Math. Artif. Intell. 15(2): 151-166 (1995) |
| 50 | | William I. Gasarch,
Efim B. Kinber,
Mark G. Pleszkoch,
Carl H. Smith,
Thomas Zeugmann:
Learning via Queries with Teams and Anomalies.
Fundam. Inform. 23(1): 67-89 (1995) |
| 49 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the Intrinsic Complexity of Learning.
Inf. Comput. 123(1): 64-71 (1995) |
| 48 | EE | Hsieh-Chang Tu,
Carl H. Smith:
Training Digraphs.
Inf. Process. Lett. 53(4): 185-192 (1995) |
| 47 | EE | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the Impact of Forgetting on Learning Machines.
J. ACM 42(6): 1146-1168 (1995) |
| 46 | | Efim B. Kinber,
Carl H. Smith,
Mahendran Velauthapillai,
Rolf Wiehagen:
On Learning Multiple Concepts in Parallel.
J. Comput. Syst. Sci. 50(1): 41-52 (1995) |
| 1994 |
|---|
| 45 | | Rusins Freivalds,
Dace Gobleja,
Marek Karpinski,
Carl H. Smith:
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.
AII/ALT 1994: 100-105 |
| 44 | | Hsieh-Chang Tu,
Carl H. Smith:
Training Diagraphs.
AII/ALT 1994: 176-186 |
| 43 | | Carl H. Smith:
Three Decades of Team Learning.
AII/ALT 1994: 211-228 |
| 42 | EE | Rusins Freivalds,
Marek Karpinski,
Carl H. Smith:
Co-Learning of Total Recursive Functions.
COLT 1994: 190-197 |
| 41 | EE | Kalvis Apsitis,
Rusins Freivalds,
Carl H. Smith:
Choosing a learning team: a topological approach.
STOC 1994: 283-289 |
| 1993 |
|---|
| 40 | | Rusins Freivalds,
Carl H. Smith:
On the Duality Between Mechanistic Learners and What it is They Learn.
ALT 1993: 137-149 |
| 39 | EE | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the Impact of Forgetting on Learning Machines.
COLT 1993: 165-174 |
| 38 | EE | Efim B. Kinber,
Carl H. Smith,
Mahendran Velauthapillai,
Rolf Wiehagen:
On Learning Multiple Concepts in Parallel.
COLT 1993: 175-181 |
| 37 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the impact of forgetting on learing machines.
Bulletin of the EATCS 49: 212-225 (1993) |
| 36 | | Rusins Freivalds,
Efim B. Kinber,
Carl H. Smith:
On the impact of forgetting on learing machines.
Bulletin of the EATCS 51: 212-225 (1993) |
| 35 | | Amihood Amir,
Carl H. Smith:
The Syntax of Parallelism.
Fundam. Inform. 19(3/4): 383-402 (1993) |
| 34 | | Rusins Freivalds,
Carl H. Smith:
On the Role of Procrastination in Machine Learning
Inf. Comput. 107(2): 237-271 (1993) |
| 1992 |
|---|
| 33 | EE | Rolf Wiehagen,
Carl H. Smith:
Generalization versus Classification.
COLT 1992: 224-230 |
| 32 | EE | Rusins Freivalds,
Carl H. Smith:
On the Role of Procrastination for Machine Learning.
COLT 1992: 363-376 |
| 31 | | Rusins Freivalds,
Carl H. Smith:
Memory Limited Inductive Inference Machines.
SWAT 1992: 19-29 |
| 30 | | William I. Gasarch,
Ramesh K. Sitaraman,
Carl H. Smith,
Mahendran Velauthapillai:
Learning programs with an easy to calculate set of errors.
Fundam. Inform. 16(3-4): 355-370 (1992) |
| 29 | EE | William I. Gasarch,
Carl H. Smith:
Learning via Queries.
J. ACM 39(3): 649-674 (1992) |
| 1991 |
|---|
| 28 | | Karlis Cerans,
Carl H. Smith:
Self-learning inductive inference machines.
Computational Intelligence 7: 174-180 (1991) |
| 27 | EE | John C. Cherniavsky,
Carl H. Smith:
On Weyuker's Axioms For Software Complexity Measures.
IEEE Trans. Software Eng. 17(6): 636-638 (1991) |
| 1990 |
|---|
| 26 | EE | Efim B. Kinber,
William I. Gasarch,
Thomas Zeugmann,
Mark G. Pleszkoch,
Carl H. Smith:
Learning Via Queries With Teams and Anomilies.
COLT 1990: 327-337 |
| 25 | | Carl H. Smith,
Mahendran Velauthapillai:
On the Inference of Approximate Programs.
Theor. Comput. Sci. 77(3): 249-266 (1990) |
| 1989 |
|---|
| 24 | | William I. Gasarch,
Ramesh K. Sitaraman,
Carl H. Smith,
Mahendran Velauthapillai:
Learning Programs With an Easy to Calculate Set of Errors.
AII 1989: 124-137 |
| 23 | | Stuart A. Kurtz,
Carl H. Smith:
A Refutation of Barzdins' Conjecture.
AII 1989: 171-176 |
| 22 | EE | Stuart A. Kurtz,
Carl H. Smith:
On the Role of Search for Learning.
COLT 1989: 303-311 |
| 21 | | Rusins Freivalds,
Carl H. Smith,
Mahendran Velauthapillai:
Trade-Off among Parameters Effecting Inductive Inference
Inf. Comput. 82(3): 323-349 (1989) |
| 20 | | Dana Angluin,
William I. Gasarch,
Carl H. Smith:
Training Sequences.
Theor. Comput. Sci. 66(3): 255-272 (1989) |
| 1988 |
|---|
| 19 | EE | William I. Gasarch,
Carl H. Smith:
Learning via Queries.
COLT 1988: 227-241 |
| 18 | EE | William I. Gasarch,
Ramesh K. Sitaraman,
Carl H. Smith,
Mahendran Velauthapillai:
Learning Programs with an Easy to Calculate Set of Errors.
COLT 1988: 242-250 |
| 17 | | William I. Gasarch,
Carl H. Smith:
Learning via Queries
FOCS 1988: 130-137 |
| 16 | | Leonard Pitt,
Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines
Inf. Comput. 77(1): 77-92 (1988) |
| 1987 |
|---|
| 15 | | Leonard Pitt,
Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines.
ICALP 1987: 1-10 |
| 14 | | John C. Cherniavsky,
Carl H. Smith:
A Recursion Theoretic Approach to Program Testing.
IEEE Trans. Software Eng. 13(7): 777-784 (1987) |
| 1986 |
|---|
| 13 | | Carl H. Smith,
Mahendran Velauthapillai:
On the Inference of Programs Approximately Computing the Desired Function.
AII 1986: 164-176 |
| 12 | | William I. Gasarch,
Carl H. Smith:
On the Inference of Sequences of Functions.
AII 1986: 23-41 |
| 11 | | Robert P. Daley,
Carl H. Smith:
On the Complexity of Inductive Inference
Information and Control 69(1-3): 12-40 (1986) |
| 1984 |
|---|
| 10 | | Robert P. Daley,
Carl H. Smith:
On the Complexity of Inductive Inference (Preliminary Report).
MFCS 1984: 255-264 |
| 9 | | Robert P. Daley,
Carl H. Smith:
On the complextiy of inductive inference.
Bulletin of the EATCS 23: 22-27 (1984) |
| 8 | | Nam Sung Woo,
Carl H. Smith,
Ashok K. Agrawala:
A Proof of the Determinacy Property of the Data Flow Schema.
Inf. Process. Lett. 19(1): 13-16 (1984) |
| 1983 |
|---|
| 7 | | Dana Angluin,
Carl H. Smith:
Inductive Inference: Theory and Methods.
ACM Comput. Surv. 15(3): 237-269 (1983) |
| 1982 |
|---|
| 6 | | Michael J. O'Donnell,
Carl H. Smith:
A Combinatorial Problem Concerning Processor Interconnection Networks.
IEEE Trans. Computers 31(2): 163-164 (1982) |
| 5 | EE | Carl H. Smith:
The Power of Pluralism for Automatic Program Synthesis.
J. ACM 29(4): 1144-1165 (1982) |
| 1981 |
|---|
| 4 | | Carl H. Smith:
The Power of Parallelism for Automatic Program Synthesis
FOCS 1981: 283-295 |
| 1976 |
|---|
| 3 | | Carl H. Smith,
Larry D. Wittie:
Memory Hardware for High Speed Job Selection.
IEEE Trans. Computers 25(2): 148-156 (1976) |
| 1974 |
|---|
| 2 | | Carl H. Smith,
Larry D. Wittie:
Discriminating Content Addressable Memories.
Sagamore Computer Conference 1974: 100-101 |
| 1 | | Jan van Leeuwen,
Carl H. Smith:
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's.
Inf. Process. Lett. 3(1): 22-24 (1974) |
