Niels Schmitt Adresse: Fakultät für Mathematik Lehrstuhl Mathematik & Informatik Ruhr-Universität Bochum D-44780 Bochum Deutschland Büro: NA 1/74 eMail: nschmitt@lmi.ruhr-uni-bochum.de Telefon: 0234-32-23207 Fax: 0234-32-14465

Arbeitsfelder
Learning Theory, Support Vector Machines

Lehrerfahrung
Übungsbetreuung Höhere Mathematik I-III

Publikationen

• Nakamura, A., Schmitt, M., Schmitt, N., and Simon, H. U. (2004).
  Bayesian Networks and Inner Product Spaces.
  Proceedings of the 17th Annual Conference on Learning Theory (COLT).
  Accepted for publication.

• Forster, J., Schmitt, N., Simon, H. U., and Suttorp, T. (2003).
  Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
  Machine Learning 51(3): 263-281.
  [Abstract]

• Bernholt, T., Gülich, A., Hofmeister, T., Schmitt, N., and Wegener, I. (2002).
  overflow: Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.
  Informatik-Spektrum 25(6): 488-502.
  [Abstract]

• Lefmann, H. and Schmitt, N. (2002).
  A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.
  SIAM Journal on Computing (SICOMP) 31(6): 1926-1947.
  [Abstract]

• Lefmann, H. and Schmitt, N. (2002).
  A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
  Proceedings of the 5th Latin American Symposium on Theoretical INformatics (LATIN). Springer LNCS 2286: 165-180.
  [Abstract]

• Forster, J., Krause, M., Lokam, S. V., Mubarakzjanov, R., Schmitt, N., and Simon, H. U. (2001).
  Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
  Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS). Springer LNCS 2245: 171-182.
  [Abstract]

• Forster, J., Schmitt, N., and Simon, H. U. (2001).
  Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
  Proceedings of the 14th Annual Conference on Computational Learning Theory (COLT) and 5th European Conference on Computational Learning Theory (EuroCOLT). Springer LNCS/LNAI 2111: 402-415.
  [Abstract  Preliminary Version]

• Schmitt, N. (2000).
  Komplexitätstheoretische und algorithmische Untersuchung des Meisterschaftsproblems.
  Diploma Thesis. Lehrstuhl Informatik 2 - Effiziente Algorithmen und Komplexitätstheorie, Universität Dortmund.
  [ps.gz-File]

• Berraqa, A., Herrmann, P., Ilayyan, N., Krumm, H., Schmitt, N., Schröder, J., Schröer, M.-C., Stöcker, S., Stoll, A., Thiemann, J., and Wiebusch, L. (2000).
  Ein flexibles komponentenstrukturiertes Intrusion Detection System.
  Proceedings of the 7th Workshop "Sicherheit in vernetzten Systemen". DFN-CERT GmbH & DFN-PCA (Editors). DFN-Report Nr. 90.
  [Slides]

• Bernholdt, T., Gülich, A., Hofmeister,T., and Schmitt, N. (1999).
  Football Elimination Is Hard to Decide Under the 3-Point-Rule.
  Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS). Springer LNCS 1672: 410-418.
  [Abstract]