|
Journals in DBLP
- Shai Ben-David, John Case, Thomas Zeugmann
Foreword. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:167-169 [Journal]
- Eric Martin, Arun Sharma, Frank Stephan
On the data consumption benefits of accepting increased uncertainty. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:170-182 [Journal]
- Jérôme Besombes, Jean-Yves Marion
Learning tree languages from positive examples and membership queries. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:183-197 [Journal]
- Robert H. Sloan, Balázs Szörényi, György Turán
Revising threshold functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:198-208 [Journal]
- Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
Learning intersection-closed classes with signatures. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:209-220 [Journal]
- Nicolò Cesa-Bianchi
Applications of regularized least squares to pattern classification. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:221-231 [Journal]
- Amiran Ambroladze, Emilio Parrado-Hernández, John Shawe-Taylor
Complexity of pattern classes and the Lipschitz property. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:232-246 [Journal]
- Marcus Hutter, Andrej Muchnik
On semimeasures predicting Martin-Löf random sequences. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:247-261 [Journal]
- Hans-Ulrich Simon
On the complexity of working set selection. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:262-279 [Journal]
|