Robust learning methods and data compression

  • Reischuk, Rüdiger (Principal Investigator (PI))

Project: DFG ProjectsDFG Individual Projects

Filter
Conference contribution

Search results

  • 2007

    When Does Greedy Learning of Relevant Attributes Succeed? A Fourier-Based Characterization

    Arpe, J. & Reischuk, R., 01.12.2007, COCOON 2007: Computing and Combinatorics . Springer Berlin Heidelberg, Vol. 4598 LNCS. p. 296-306 11 p. (Lecture Notes in Computer Science; vol. 4598 LNCS).

    Research output: Chapters in Books/Reports/Conference ProceedingsConference contributionpeer-review

  • 2006

    Approximability of Minimum AND-Circuits

    Arpe, J. & Manthey, B., 01.01.2006, SWAT 2006: Algorithm Theory – SWAT 2006. Springer Verlag, Vol. 4059 LNCS. p. 292-303 12 p. (Lecture Notes in Computer Science ; vol. 4059 LNCS).

    Research output: Chapters in Books/Reports/Conference ProceedingsConference contributionpeer-review

  • Learning Juntas in the Presence of Noise

    Arpe, J. & Reischuk, R., 17.07.2006, TAMC 2006: Theory and Applications of Models of Computation. Springer Berlin Heidelberg, Vol. 3959 LNCS. p. 387-398 12 p. (Lecture Notes in Computer Science; vol. 3959 LNCS).

    Research output: Chapters in Books/Reports/Conference ProceedingsConference contributionpeer-review

  • On the Complexity of Optimal Grammar-Based Compression

    Arpe, J. & Reischuk, R., 01.12.2006, Data Compression Conference (DCC'06). IEEE, p. 173-182 10 p. 1607252. (Data Compression Conference Proceedings).

    Research output: Chapters in Books/Reports/Conference ProceedingsConference contributionpeer-review

  • 2003

    Learning a Subclass of Regular Patterns in Polynomial Time

    Case, J., Jain, S., Reischuk, R., Stephan, F. & Zeugmann, T., 01.01.2003, ALT 2003: Algorithmic Learning Theory. Springer Berlin Heidelberg, Vol. 2842. p. 234-246 13 p. (Lecture Notes in Computer Science; vol. 2842).

    Research output: Chapters in Books/Reports/Conference ProceedingsConference contributionpeer-review