default search action
Carl H. Smith
- > Home > Persons > Carl H. Smith
Publications
- 2008
- [j46]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning with belief levels. J. Comput. Syst. Sci. 74(4): 527-545 (2008) - 2003
- [j45]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
- [j43]Brian Postow, Kenneth W. Regan, Carl H. Smith:
UPSILON: Universal Programming System with Incomplete Lazy Object Notation. Fundam. Informaticae 50(3-4): 325-359 (2002) - [j42]Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen:
Learning by the Process of Elimination. Inf. Comput. 176(1): 37-50 (2002) - [c43]Rusins Freivalds, Carl H. Smith:
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. LATIN 2002: 386-399 - [e2]Steffen Lange, Ken Satoh, Carl H. Smith:
Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings. Lecture Notes in Computer Science 2534, Springer 2002, ISBN 3-540-00188-3 [contents] - 2001
- [j41]Sanjay Jain, Carl H. Smith, Rolf Wiehagen:
Robust Learning Is Rich. J. Comput. Syst. Sci. 62(1): 178-212 (2001) - [j40]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) - [j39]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. 261(1): 91-117 (2001) - [c42]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Towards Axiomatic Basis of Inductive Inference. FCT 2001: 1-13 - 2000
- [c41]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
- [j38]Andris Ambainis, Rusins Freivalds, Carl H. Smith:
Inductive Inference with Procrastination: Back to Definitions. Fundam. Informaticae 40(1): 1-16 (1999) - [j37]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) - [j36]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) - [c40]Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen:
On the Intrinsic Complexity of Learning Recursive Functions. COLT 1999: 257-266 - 1998
- [j35]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) - [c39]Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Editor's Introduction. ALT 1998: 1-10 - [c38]Sanjay Jain, Carl H. Smith, Rolf Wiehagen:
On the Power of Learning Robustly. COLT 1998: 187-197 - [c37]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
A Logic of Discovery. Discovery Science 1998: 401-402 - [e1]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. Lecture Notes in Computer Science 1501, Springer 1998, ISBN 3-540-65013-X [contents] - 1997
- [j34]Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Classifying Predicates and Languages. Int. J. Found. Comput. Sci. 8(1): 15-42 (1997) - [c36]Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith:
Team Learning as a Game. ALT 1997: 2-17 - [c35]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Asymmetric Team Learning. COLT 1997: 90-95 - [c34]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning Formulae from Elementary Facts. EuroCOLT 1997: 272-285 - [c33]Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information. LFCS 1997: 102-112 - 1996
- [j33]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On Duality in Learning and the Selection of Learning Terms. Inf. Comput. 129(1): 53-62 (1996) - [c32]Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning with Confidence. STACS 1996: 207-218 - [c31]Andris Ambainis, Rusins Freivalds, Carl H. Smith:
General Inductive Inference Types Based on Linearly-Ordered Sets. STACS 1996: 243-253 - 1995
- [j32]Carl H. Smith, William I. Gasarch:
Recursion Theoretic Models of Learning: Some Results and Intuitions. Ann. Math. Artif. Intell. 15(2): 151-166 (1995) - [j31]William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann:
Learning via Queries with Teams and Anomalies. Fundam. Informaticae 23(1): 67-89 (1995) - [j30]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Intrinsic Complexity of Learning. Inf. Comput. 123(1): 64-71 (1995) - [j28]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. J. ACM 42(6): 1146-1168 (1995) - [j27]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) - [j26]Rolf Wiehagen, Carl H. Smith:
Generalization versus classification. J. Exp. Theor. Artif. Intell. 7(2): 163-174 (1995) - [c30]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
On the Inductive Inference of Real Valued Functions. COLT 1995: 170-177 - [c29]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the intrinsic complexity of learning. EuroCOLT 1995: 154-168 - [c28]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
Probabilistic versus Deterministic Memory Limited Learning. GOSLER Final Report 1995: 155-161 - [c27]Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann:
Classifying Recursive Predicates and Languages. GOSLER Final Report 1995: 174-189 - [c26]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 - 1994
- [c25]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 - [c22]Rusins Freivalds, Marek Karpinski, Carl H. Smith:
Co-Learning of Total Recursive Functions. COLT 1994: 190-197 - [c21]Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Choosing a learning team: a topological approach. STOC 1994: 283-289 - 1993
- [j25]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 49: 212-225 (1993) - [j24]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the impact of forgetting on learing machines. Bull. EATCS 51: 212-225 (1993) - [j23]Amihood Amir, Carl H. Smith:
The Syntax of Parallelism. Fundam. Informaticae 19(3/4): 383-402 (1993) - [j22]Rusins Freivalds, Carl H. Smith:
On the Role of Procrastination in Machine Learning. Inf. Comput. 107(2): 237-271 (1993) - [c20]Rusins Freivalds, Carl H. Smith:
On the Duality Between Mechanistic Learners and What it is They Learn. ALT 1993: 137-149 - [c19]Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines. COLT 1993: 165-174 - [c18]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. COLT 1993: 175-181 - [c17]Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann:
Classification of predicates and languages. EuroCOLT 1993: 171-181 - 1992
- [j21]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai:
Learning programs with an easy to calculate set of errors. Fundam. Informaticae 16(3-4): 355-370 (1992) - [j20]William I. Gasarch, Carl H. Smith:
Learning via Queries. J. ACM 39(3): 649-674 (1992) - [c16]Rolf Wiehagen, Carl H. Smith:
Generalization versus Classification. COLT 1992: 224-230 - [c15]Rusins Freivalds, Carl H. Smith:
On the Role of Procrastination for Machine Learning. COLT 1992: 363-376 - [c14]Rusins Freivalds, Carl H. Smith:
Memory Limited Inductive Inference Machines. SWAT 1992: 19-29 - 1991
- [j19]Karlis Cerans, Carl H. Smith:
Self-learning inductive inference machines. Comput. Intell. 7: 174-180 (1991) - [j18]John C. Cherniavsky, Carl H. Smith:
On Weyuker's Axioms For Software Complexity Measures. IEEE Trans. Software Eng. 17(6): 636-638 (1991) - 1990
- [j17]Carl H. Smith, Mahendran Velauthapillai:
On the Inference of Approximate Programs. Theor. Comput. Sci. 77(3): 249-266 (1990) - [c13]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 - 1989
- [j16]Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai:
Trade-Off among Parameters Effecting Inductive Inference. Inf. Comput. 82(3): 323-349 (1989) - [j15]Dana Angluin, William I. Gasarch, Carl H. Smith:
Training Sequences. Theor. Comput. Sci. 66(3): 255-272 (1989) - [c12]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 - [c11]Stuart A. Kurtz, Carl H. Smith:
A Refutation of Barzdins' Conjecture. AII 1989: 171-176 - [c10]Stuart A. Kurtz, Carl H. Smith:
On the Role of Search for Learning. COLT 1989: 303-311 - 1988
- [j14]Leonard Pitt, Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines. Inf. Comput. 77(1): 77-92 (1988) - [j12]Clyde P. Kruskal, Carl H. Smith:
On the notion of granularity. J. Supercomput. 1(4): 395-408 (1988) - [c9]William I. Gasarch, Carl H. Smith:
Learning via Queries. COLT 1988: 227-241 - [c8]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 - [c7]William I. Gasarch, Carl H. Smith:
Learning via Queries. FOCS 1988: 130-137 - 1987
- [j11]John C. Cherniavsky, Carl H. Smith:
A Recursion Theoretic Approach to Program Testing. IEEE Trans. Software Eng. 13(7): 777-784 (1987) - [c6]Leonard Pitt, Carl H. Smith:
Probability and Plurality for Aggregations of Learning Machines. ICALP 1987: 1-10 - 1986
- [j10]Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference. Inf. Control. 69(1-3): 12-40 (1986) - [c5]William I. Gasarch, Carl H. Smith:
On the Inference of Sequences of Functions. AII 1986: 23-41 - [c4]Carl H. Smith, Mahendran Velauthapillai:
On the Inference of Programs Approximately Computing the Desired Function. AII 1986: 164-176 - 1984
- [j8]Robert P. Daley, Carl H. Smith:
On the complextiy of inductive inference. Bull. EATCS 23: 22-27 (1984) - [c3]Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference (Preliminary Report). MFCS 1984: 255-264 - 1983
- [j6]Dana Angluin, Carl H. Smith:
Inductive Inference: Theory and Methods. ACM Comput. Surv. 15(3): 237-269 (1983) - 1982
- [j4]Michael J. O'Donnell, Carl H. Smith:
A Combinatorial Problem Concerning Processor Interconnection Networks. IEEE Trans. Computers 31(2): 163-164 (1982) - 1974
- [j2]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) - [j1]Carl H. Smith, Jan van Leeuwen:
Microprogrammed random access stored program machines. SIGACT News 6(3): 23-32 (1974)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-06 23:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint