Academic degrees

BSc (2007) and MSc (2009), both in Computer Science and Engineering, from the Instituto Superior Técnico (IST), the engineering school of the University of Lisbon.

Research

I am a final-year PhD student at IST and INESC-ID's Intelligent Agents and Synthetic Characters group, where I work with Andreas Wichert on neural coding and memory. I am interested in understanding how neural circuits can efficiently perform the complex computations that underlie memory-related cognitive processes. My approach is theoretical, and I use computational techniques and tools from statistics, information theory and nonlinear dynamics.

My research is funded by a doctoral grant awarded by the Portuguese Fundação para a Ciência e Tecnologia (contract SFRH/BD/66398/2009).

Publications

Diogo Rendeiro, João Sacramento, Andreas Wichert (2014). Taxonomical associative memory.
Cognitive Computation, vol. 6, no. 1, pp. 45-65, doi:10.1007/s12559-012-9198-4.
João Sacramento and Andreas Wichert (2012). Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory.
Biological Cybernetics, vol. 106, no. 2, pp. 123-133, doi:10.1007/s00422-012-0488-4.
Preprint available in pdf and ps.gz.
João Sacramento, Francisco Burnay, Andreas Wichert (2012). Regarding the temporal requirements of a hierarchical Willshaw network.
Neural Networks, vol. 25, pp. 84-93, doi:10.1016/j.neunet.2011.07.005.
Preprint available in pdf and ps.gz.
João Sacramento and Andreas Wichert (2011). Tree-like hierarchical associative memory structures.
Neural Networks, vol. 24, no. 2, pp. 143-147, doi:10.1016/j.neunet.2010.09.012.
Preprint available in pdf and ps.gz.

Supervised theses

Diogo Rendeiro (2011). Taxonomic associative memory.
MSc thesis, Department of Computer Science and Engineering, Technical University of Lisbon.
Jointly supervised with Andreas Wichert.

Teaching

I serve as a teaching assistant at the Department of Computer Science and Engineering of IST, where I have been lecturing practical classes on computer programming and basic algorithms.