no code implementations • 22 Apr 2024 • Karim G. Habashy, Benjamin D. Evans, Dan F. M. Goodman, Jeffrey S. Bowers
Evolution has yielded a diverse set of neurons with varying morphologies and physiological properties that impact their processing of temporal information.
1 code implementation • 4 Jun 2021 • Gabriel Béna, Dan F. M. Goodman
It has long been believed that the brain is highly modular both in terms of structure and function, although recent evidence has led some to question the extent of both types of modularity.
1 code implementation • NeurIPS 2021 • Nicolas Perez-Nieves, Dan F. M. Goodman
There is an increasing interest in emulating Spiking Neural Networks (SNNs) on neuromorphic computing devices due to their low energy consumption.
Ranked #4 on Image Classification on N-MNIST
1 code implementation • 23 Oct 2018 • Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph.
Computational Geometry
3 code implementations • 12 Oct 2017 • Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman
A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input.
Computational Geometry
1 code implementation • 11 Sep 2013 • Shabnam N. Kadir, Dan F. M. Goodman, Kenneth D. Harris
Cluster analysis faces two problems in high dimensions: first, the `curse of dimensionality' that can lead to overfitting and poor generalization performance; and second, the sheer time taken for conventional algorithms to process large amounts of high-dimensional data.