The SCEAS System
| |||||||

## Search the dblp DataBase
Robert A. Legenstein:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Wolfgang Maass, Robert A. Legenstein, Henry Markram
**A New Approach towards Vision Suggested by Biologically Realistic Neural Microcircuit Models.**[Citation Graph (0, 0)][DBLP] Biologically Motivated Computer Vision, 2002, pp:282-293 [Conf] - Nils Bertschinger, Thomas Natschläger, Robert A. Legenstein
**At the Edge of Chaos: Real-time Computations and Self-Organized Criticality in Recurrent Neural Networks.**[Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf] - Robert A. Legenstein, Wolfgang Maass
**Foundations for a Circuit Complexity Theory of Sensory Processing.**[Citation Graph (0, 0)][DBLP] NIPS, 2000, pp:259-265 [Conf] - Robert A. Legenstein, Wolfgang Maass
**A Criterion for the Convergence of Learning with Spike Timing Dependent Plasticity.**[Citation Graph (0, 0)][DBLP] NIPS, 2005, pp:- [Conf] - Wolfgang Maass, Robert A. Legenstein, Nils Bertschinger
**Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits.**[Citation Graph (0, 0)][DBLP] NIPS, 2004, pp:- [Conf] - Robert A. Legenstein, Wolfgang Maass
**Optimizing the Layout of a Balanced Tree**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:069, pp:- [Journal] - Robert A. Legenstein, Wolfgang Maass
**Total Wire Length as a Salient Circuit Complexity Measure for Sensory Processing**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:070, pp:- [Journal] - Robert A. Legenstein, Wolfgang Maass
**Neural Circuits for Pattern Recognition with Small Total Wire Length**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:071, pp:- [Journal] - Robert A. Legenstein
**On the Complexity of Knock-knee Channel-Routing with 3-Terminal Nets**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:076, pp:- [Journal] - Robert A. Legenstein, Wolfgang Maass
**Wire length as a circuit complexity measure.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:70, n:1, pp:53-72 [Journal] - Robert A. Legenstein, Christian Naeger, Wolfgang Maass
**What Can a Neuron Learn with Spike-Timing-Dependent Plasticity?**[Citation Graph (0, 0)][DBLP] Neural Computation, 2005, v:17, n:11, pp:2337-2382 [Journal] - Robert A. Legenstein, Wolfgang Maass
**Neural circuits for pattern recognition with small total wire length.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:287, n:1, pp:239-249 [Journal] - Stefan Klampfl, Robert A. Legenstein, Wolfgang Maass
**Information Bottleneck Optimization and Independent Component Extraction with Spiking Neurons.**[Citation Graph (0, 0)][DBLP] NIPS, 2006, pp:713-720 [Conf] - Robert A. Legenstein, Wolfgang Maass
**Edge of chaos and prediction of computational performance for neural circuit models.**[Citation Graph (0, 0)][DBLP] Neural Networks, 2007, v:20, n:3, pp:323-334 [Journal] **Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity.**[Citation Graph (, )][DBLP]**On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |