Department Mathematics and Information Technology

Organisational unit: Departments and Institutes

641 - 660 out of 775Page size: 20

Sort by: Publication date

Research output

1998
Published
Comparison of permanental bounds of (0,1) matrices
Hwang, S.-G. & Kräuter, A. R., 1998, In: Discrete applied mathematics. 84, p. 133-144
Research output: Contribution to journal › Article › Research › peer-review
Published
Digraphical regular representations of infinite finitely generated groups
Seifter, N. & Möller, R. G., 1998, In: European journal of combinatorics .
Research output: Contribution to journal › Article › Research › peer-review
Published
Introduction to the Special Issue on Computational Learning Theory
Auer, P. & Maas, W., 1998, In: Algorithmica. 22, p. 1-2
Research output: Contribution to journal › Article › Research › peer-review
Published
Lattices in graphs with polynomial growth
Seifter, N. & Lukacs, A., 1998, In: Discrete mathematics.
Research output: Contribution to journal › Article › Research › peer-review
Published
On Learning from Ambiguous Information
Auer, P., 1998, In: Periodica polytechnica / Electrical engineering. 1, p. 115-122
Research output: Contribution to journal › Article › Research › peer-review
Published
On-line Learning with Malicious Noise and the Closure Algorithm
Auer, P. & Cesa-Bianchi, N., 1998, In: Annals of mathematics and artificial intelligence. 23, p. 83-99
Research output: Contribution to journal › Article › Research › peer-review
Published
Some thoughts on Boosting and Neural Networks
Auer, P., 1998, 3. Cottbuser Workshop "Aspekte des Neuronalen Lernens". p. 11-28
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Tracking the Best Disjunction
Auer, P. & Warmuth, M. K., 1998, In: Machine learning. 32, p. 127-150
Research output: Contribution to journal › Article › Research › peer-review
1997
Published
Recognizing Hamming graphs in linear time and space
Imrich, W. & Klavžr, S., 28 Jul 1997, In: Information processing letters. 63, 2, p. 91-95 5 p.
Research output: Contribution to journal › Article › Research › peer-review
Published
Recognizing Cartesian graph bundles
Imrich, W., Pisanski, T. & Žerovnik, J., 15 Apr 1997, In: Discrete mathematics. 167-168, p. 393-403 11 p.
Research output: Contribution to journal › Article › Research › peer-review
Published
Approximating Hyper-Rectangles: Learning and Pseudo-random Sets
Auer, P., Long, P. M. & Srinivasan, A., 1997, Proc. 29th Ann. Symp. Theory of Computing. p. 314-323
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Automorphism groups of covering graphs
Seifter, N. & Trofimov, V. I., 1997, In: Journal of combinatorial theory. Series B.
Research output: Contribution to journal › Article › Research › peer-review
Published
Automorphism groups of graphs with quadratic growth
Seifter, N. & Trofimov, V. I., 1997, In: Journal of combinatorial theory. Series B.
Research output: Contribution to journal › Article › Research › peer-review
Published
Learning Nested Differences in the Presence of Malicious Noise
Auer, P., 1997, In: Theoretical Computer Science. 185, p. 159-175
Research output: Contribution to journal › Article › Research › peer-review
Published
On Learning from Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach
Auer, P., 1997, On Learning from Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach. p. 21-29
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
The Perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant
Auer, P., Kivinen, J. & Warmuth, M. K., 1997, In: Artificial intelligence. p. 325-343
Research output: Contribution to journal › Article › Research › peer-review
1996
Published
Well configurations in anisotropic reservoirs
Economides, M. J., Brand, C. W. & Frick, T. P., Dec 1996, In: SPE Formation Evaluation. 11, 4, p. 257-260 4 p.
Research output: Contribution to journal › Article › Research › peer-review
Published
On the weak reconstruction of Cartesian-product graphs
Imrich, W. & Žerovnik, J., 6 Apr 1996, In: Discrete mathematics. 150, 1-3, p. 167-178 12 p.
Research output: Contribution to journal › Article › Research › peer-review
Published
On the complexity of recognizing Hamming graphs and related classes of graphs
Imrich, W. & Klavžar, S., Feb 1996, In: European journal of combinatorics . 17, 2-3, p. 209-221 13 p.
Research output: Contribution to journal › Article › Research › peer-review
Published
Eigenvalues and domination in graphs
Seifter, N. & Brand, C., 1996, In: Mathematica Slovaca.
Research output: Contribution to journal › Article › Research › peer-review

Previous 1...29 30 31 32 33 34 35 36 ...39 Next

Research Portal

Department Mathematics and Information Technology

Research output

Comparison of permanental bounds of (0,1) matrices

Digraphical regular representations of infinite finitely generated groups

Introduction to the Special Issue on Computational Learning Theory

Lattices in graphs with polynomial growth

On Learning from Ambiguous Information

On-line Learning with Malicious Noise and the Closure Algorithm

Some thoughts on Boosting and Neural Networks

Tracking the Best Disjunction

Recognizing Hamming graphs in linear time and space

Recognizing Cartesian graph bundles

Approximating Hyper-Rectangles: Learning and Pseudo-random Sets

Automorphism groups of covering graphs

Automorphism groups of graphs with quadratic growth

Learning Nested Differences in the Presence of Malicious Noise

On Learning from Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach

The Perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant

Well configurations in anisotropic reservoirs

On the weak reconstruction of Cartesian-product graphs

On the complexity of recognizing Hamming graphs and related classes of graphs

Eigenvalues and domination in graphs

Contact information