Wolfgang Lindner

According to our database, Wolfgang Lindner authored at least 16 papers between 1997 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

On the fusion of threshold classifiers for categorization and dimensionality reduction.

Hans A. Kestler, Ludwig Lausser, Wolfgang Lindner, Günther Palm

Comput. Stat., 2011

2009

Parameterized learnability of juntas.

Vikraman Arvind, Johannes Köbler, Wolfgang Lindner

Theor. Comput. Sci., 2009

2007

A general dimension for query learning.

José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner

J. Comput. Syst. Sci., 2007

Parameterized Learnability of <i>k</i> -Juntas and Related Problems.

Vikraman Arvind, Johannes Köbler, Wolfgang Lindner

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006

The complexity of learning concept classes with polynomial general dimension.

Johannes Köbler, Wolfgang Lindner

Theor. Comput. Sci., 2006

Learning Boolean Functions under the Uniform.

Johannes Köbler, Wolfgang Lindner

Bull. EATCS, 2006

Learning and Feature Selection Using the Set Covering Machine with Data-Dependent Rays on Gene Expression Profiles.

Hans A. Kestler, Wolfgang Lindner, André Müller

Proceedings of the Artificial Neural Networks in Pattern Recognition, Second IAPR Workshop, 2006

2005

Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution.

Wolfgang Lindner

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2002

A General Dimension for Approximately Learning Boolean Functions.

Johannes Köbler, Wolfgang Lindner

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2000

Resource-Bounded Measure and Learnability.

Wolfgang Lindner, Rainer Schuler, Osamu Watanabe

Theory Comput. Syst., 2000

Oracles in S^p₂ are Sufficient for Exact Learning.

Johannes Köbler, Wolfgang Lindner

Int. J. Found. Comput. Sci., 2000

On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation.

Johannes Köbler, Wolfgang Lindner

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Resource bounded measure and learnability.

Wolfgang Lindner

PhD thesis, 1999

1998

On the Resource Bounded Measure of P/poly.

Johannes Köbler, Wolfgang Lindner

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

On Sets Turing Reducible to p-Selective Sets.

Hans-Jörg Burtschick, Wolfgang Lindner

Theory Comput. Syst., 1997

Oracles in Sigma^<i>p</i>₂ are Sufficient for Exact Learning.

Johannes Köbler, Wolfgang Lindner

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997