Travelled to:1 × Canada
1 × Finland
1 × Italy
5 × USA
Collaborated with:∅ M.K.Warmuth M.Dietzfelbinger G.Neumann J.Peters K.Uchizawa R.J.Douglas P.Auer R.C.Holte A.Hajnal G.Turán G.Schnitger E.Szemerédi
Talks about:complex (5) learn (4) tape (4) machin (3) ture (3) one (3) threshold (2) motion (2) bound (2) line (2)
Person: Wolfgang Maass
DBLP: Maass:Wolfgang
Contributed to:
2009
20061995
19931988198819871984Wrote 9 papers:
- ICML-2009-NeumannMP #learning
- Learning complex motions by sequencing simpler motion templates (GN, WM, JP), pp. 753–760.
- ICALP-v1-2006-UchizawaDM #complexity #energy
- Energy Complexity and Entropy of Threshold Circuits (KU, RJD, WM), pp. 631–642.
- ICML-1995-AuerHM #theory and practice
- Theory and Applications of Agnostic PAC-Learning with Small Decision Trees (PA, RCH, WM), pp. 21–29.
- ICML-1995-MaassW #learning #performance
- Efficient Learning with Virtual Threshold Gates (WM, MKW), pp. 378–386.
- STOC-1993-Maass #bound #complexity #learning
- Bounds for the computational power and learning complexity of analog neural nets (WM), pp. 335–344.
- ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine
- The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
- STOC-1988-HajnalMT #communication #complexity #graph #on the
- On the Communication Complexity of Graph Properties (AH, WM, GT), pp. 186–191.
- STOC-1987-MaassSS #turing machine
- Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
- STOC-1984-Maass #bound #nondeterminism #polynomial #turing machine
- Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (WM), pp. 401–408.