default search action
Dan F. M. Goodman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Marcus Ghosh
, Gabriel Béna, Volker Bormuth, Dan F. M. Goodman
Nonlinear fusion is optimal for a wide class of multisensory tasks. PLoS Comput. Biol. 20(7): 1012246 (2024) - [i7]Karim Habashy, Benjamin D. Evans, Dan F. M. Goodman, Jeffrey S. Bowers:
Adapting to time: why nature evolved a diverse set of neurons. CoRR abs/2404.14325 (2024) - 2023
- [i6]Nicolas Perez Nieves, Dan F. M. Goodman:
Spiking Network Initialisation and Firing Rate Collapse. CoRR abs/2305.08879 (2023) - 2021
- [j13]Jonathan X. Zheng
Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization. IEEE Trans. Vis. Comput. Graph. 27(3): 2244-2249 (2021) - [c2]Nicolas Perez Nieves, Dan F. M. Goodman:
Sparse Spiking Gradient Descent. NeurIPS 2021: 11795-11808 - [i5]Nicolas Perez Nieves, Dan F. M. Goodman:
Sparse Spiking Gradient Descent. CoRR abs/2105.08810 (2021) - [i4]Gabriel Béna, Dan F. M. Goodman:
Extreme sparsity gives rise to functional specialization. CoRR abs/2106.02626 (2021)
2010 – 2019
- 2019
- [j12]Jonathan X. Zheng
Graph Drawing by Stochastic Gradient Descent. IEEE Trans. Vis. Comput. Graph. 25(9): 2738-2748 (2019) - 2018
- [j11]Inga Blundell, Romain Brette
Code Generation in Computational Neuroscience: A Review of Tools and Techniques. Frontiers Neuroinformatics 12: 68 (2018) - [i3]Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman:
Comments on "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization". CoRR abs/1810.09948 (2018) - 2017
- [i2]Jonathan X. Zheng, Dan F. M. Goodman, Samraat Pawar:
Graph Drawing by Weighted Constraint Relaxation. CoRR abs/1710.04626 (2017) - 2014
- [j10]Marcel Stimberg
Equation-oriented specification of neural models for simulations. Frontiers Neuroinformatics 8: 6 (2014) - [j9]Shabnam N. Kadir
High-Dimensional Cluster Analysis with the Masked EM Algorithm. Neural Comput. 26(11): 2379-2394 (2014) - [r1]Dan F. M. Goodman, Romain Brette:
Brian Spiking Neural Network Simulator. Encyclopedia of Computational Neuroscience 2014 - 2013
- [j8]Cyrille Rossant
Playdoh: A lightweight Python library for distributed computing and optimisation. J. Comput. Sci. 4(5): 352-359 (2013) - [j7]Dan F. M. Goodman, Romain Brette:
Brian simulator. Scholarpedia 8(1): 10883 (2013) - [i1]Shabnam N. Kadir, Dan F. M. Goodman, Kenneth D. Harris:
High-dimensional cluster analysis with the Masked EM Algorithm. CoRR abs/1309.2848 (2013) - 2011
- [j6]Bertrand Fontaine, Dan F. M. Goodman, Victor Benichoux, Romain Brette
Brian Hears: Online Auditory Processing Using Vectorization Over Channels. Frontiers Neuroinformatics 5: 9 (2011) - [j5]Romain Brette
Vectorized Algorithms for Spiking Neural Network Simulation. Neural Comput. 23(6): 1503-1535 (2011) - 2010
- [j4]Cyrille Rossant
Automatic fitting of spiking neuron models to electrophysiological recordings. Frontiers Neuroinformatics 4: 2 (2010) - [j3]Dan F. M. Goodman:
Code Generation: A Strategy for Neural Network Simulators. Neuroinformatics 8(3): 183-196 (2010) - [j2]Dan F. M. Goodman, Romain Brette
Spike-Timing-Based Computation in Sound Localization. PLoS Comput. Biol. 6(11) (2010) - [c1]Dan F. M. Goodman, Romain Brette:
Learning to localise sounds with spiking neural networks. NIPS 2010: 784-792
2000 – 2009
- 2008
- [j1]Dan F. M. Goodman, Romain Brette
Brian: a simulator for spiking neural networks in Python. Frontiers Neuroinformatics 2: 5 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: