- CSB - MetaPress - Google - Bing - Yahoo
 | 2001 | |
|---|---|---|
| j4 |      | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith: Hierarchies of probabilistic and team FIN-learning. Theor. Comput. Sci. 261(1): 91-117 (2001) |
| j3 | | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs: Closedness properties in ex-identification. Theor. Comput. Sci. 268(2): 367-393 (2001) |
| 1999 | ||
| j2 | | 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 | ||
| c12 | | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs: Closedness Properties in EX-Identification of Recursive Functions. ALT 1998: 46-60 |
| 1997 | ||
| c11 | | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith: Team Learning as a Game. ALT 1997: 2-17 |
| c10 | | Andris Ambainis, Kalvis Apsitis, Cristian Calude, Rusins Freivalds, Marek Karpinski, Tomas Larfeldt, Iveta Sala, Juris Smotrovs: Effects of Kolmogorov Complexity Present in Inductive Inference as Well. ALT 1997: 244-259 |
| c9 | | Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude: Tally Languages Accepted by Alternating Multitape Finite Automata. COCOON 1997: 422-430 |
| c8 | | |
| 1996 | ||
| j1 | | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith: On Duality in Learning and the Selection of Learning Terms. Inf. Comput. 129(1): 53-62 (1996) |
| c7 | | Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs: Unions of identifiable families of languages. ICGI 1996: 48-58 |
| 1995 | ||
| c6 | | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith: On the Inductive Inference of Real Valued Functions. COLT 1995: 170-177 |
| c5 | | Kalvis Apsitis: Topological Considerations in Composing Teams of Learning Machines. GOSLER Final Report 1995: 146-154 |
| 1994 | ||
| c4 | | |
| c3 | | Kalvis Apsitis, Rusins Freivalds, Carl H. Smith: Choosing a learning team: a topological approach. STOC 1994: 283-289 |
| 1993 | ||
| c2 | | Janis Barzdins, Guntis Barzdins, Kalvis Apsitis, Ugis Sarkans: Towards Efficient Inductive Synthesis of Expressions from Input/Output Examples. ALT 1993: 59-72 |
| 1992 | ||
| c1 | | Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs: Unions of Identifiable Classes of Total Recursive Functions. AII 1992: 99-107 |
Data released under the ODC-BY 1.0 license — See also our legal information page