|
Search the dblp DataBase
Niels Schmitt:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jürgen Forster, Niels Schmitt, Hans-Ulrich Simon
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. [Citation Graph (0, 0)][DBLP] COLT/EuroCOLT, 2001, pp:402-415 [Conf]
- Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon
Bayesian Networks and Inner Product Spaces. [Citation Graph (0, 0)][DBLP] COLT, 2004, pp:518-533 [Conf]
- Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:171-182 [Conf]
- Hanno Lefmann, Niels Schmitt
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. [Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:165-180 [Conf]
- Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt
Football Elimination Is Hard to Decide Under the 3-Point-Rule. [Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:410-418 [Conf]
- Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener
Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. [Citation Graph (0, 0)][DBLP] Informatik Spektrum, 2002, v:25, n:6, pp:488-502 [Journal]
- Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon
Inner Product Spaces for Bayesian Networks. [Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2005, v:6, n:, pp:1383-1403 [Journal]
- Jürgen Forster, Niels Schmitt, Hans-Ulrich Simon, Thorsten Suttorp
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. [Citation Graph (0, 0)][DBLP] Machine Learning, 2003, v:51, n:3, pp:263-281 [Journal]
- Hanno Lefmann, Niels Schmitt
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:6, pp:1926-1947 [Journal]
Search in 0.002secs, Finished in 0.002secs
|