default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérémie Cabessa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Jirí Síma, Jérémie Cabessa
, Petra Vidnerová:
On energy complexity of fully-connected layers. Neural Networks 178: 106419 (2024)- [i2]Jérémie Cabessa, Hugo Hernault, Umer Mushtaq:
In-Context Learning and Fine-Tuning GPT for Argument Mining. CoRR abs/2406.06699 (2024) - 2023
- [c28]Umer Mushtaq, Jérémie Cabessa:
Argument Mining with Modular BERT and Transfer Learning. IJCNN 2023: 1-8 - [c27]Jirí Síma, Jérémie Cabessa:
Energy Complexity of Fully-Connected Layers. IWANN (1) 2023: 3-15 - [i1]Jérémie Cabessa, Yann Strozecki:
Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks. CoRR abs/2309.17032 (2023) - 2022
- [c26]Jérémie Cabessa, Hugo Hernault, Yves Lamonato, Mathieu Rochat, Yariv Z. Levy:
The EsnTorch Library: Efficient Implementation of Transformer-Based Echo State Networks. ICONIP (7) 2022: 235-246 - [c25]Umer Mushtaq, Jérémie Cabessa:
Argument Classification with BERT Plus Contextual, Structural and Syntactic Features as Text. ICONIP (4) 2022: 622-633 - [c24]Jérémie Cabessa:
Turing Computation with Neural Networks Composed of Synfire Rings. IJCNN 2022: 1-8 - 2021
- [c23]Jérémie Cabessa, Hugo Hernault, Heechang Kim, Yves Lamonato, Yariv Z. Levy:
Efficient Text Classification with Echo State Networks. IJCNN 2021: 1-8 - 2020
- [j10]Jérémie Cabessa, Aubin Tchaptchet:
Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings. Neural Networks 126: 312-334 (2020)
2010 – 2019
- 2019
- [j9]Jérémie Cabessa, Olivier Finkel:
Computational capabilities of analog and evolving neural networks over infinite input streams. J. Comput. Syst. Sci. 101: 86-99 (2019) - [c22]Jérémie Cabessa, Jirí Síma:
Robust Optimal-Size Implementation of Finite State Automata with Synfire Ring-Based Neural Networks. ICANN (1) 2019: 806-818 - [c21]Jérémie Cabessa, Alessandro E. P. Villa:
A Memory-Based STDP Rule for Stable Attractor Dynamics in Boolean Recurrent Neural Networks. IJCNN 2019: 1-8 - 2018
- [c20]Jérémie Cabessa, Alessandro E. P. Villa:
An STDP Rule for the Improvement and Stabilization of the Attractor Dynamics of the Basal Ganglia-Thalamocortical Network. ICANN (3) 2018: 693-702 - [c19]Jérémie Cabessa, Aubin Tchaptchet:
Automata Computation with Hodgkin-Huxley Based Neural Networks Composed of Synfire Rings. IJCNN 2018: 1-8 - 2017
- [j8]Christian W. Bach, Jérémie Cabessa:
Limit-agreeing to disagree. J. Log. Comput. 27(4): 1169-1187 (2017) - [c18]Jérémie Cabessa, Olivier Finkel:
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. FCT 2017: 150-163 - [c17]Jérémie Cabessa, Ginette Horcholle-Bossavit, Brigitte Quenet:
Neural Computation with Spiking Neural Networks Composed of Synfire Rings. ICANN (1) 2017: 245-253 - [c16]Jérémie Cabessa, Alessandro E. P. Villa:
Interactive Control of Computational Power in a Model of the Basal Ganglia-Thalamocortical Circuit by a Supervised Attractor-Based Learning Procedure. ICANN (1) 2017: 334-342 - [c15]Jérémie Cabessa, Paolo Masulli:
Emulation of finite state automata with networks of synfire rings. IJCNN 2017: 4641-4648 - 2016
- [j7]Jérémie Cabessa, Jacques Duparc:
Expressive Power of Nondeterministic Recurrent Neural Networks in Terms of their Attractor Dynamics. Int. J. Unconv. Comput. 12(1): 25-50 (2016) - [j6]Jérémie Cabessa, Alessandro E. P. Villa:
Expressive power of first-order recurrent neural networks determined by their attractor dynamics. J. Comput. Syst. Sci. 82(8): 1232-1250 (2016) - [c14]Jérémie Cabessa, Alessandro E. P. Villa:
Attractor Dynamics Driven by Interactivity in Boolean Recurrent Neural Networks. ICANN (1) 2016: 115-122 - [c13]Jérémie Cabessa, Alessandro E. P. Villa:
Attractor-based complexity of a Boolean model of the basal ganglia-thalamocortical network. IJCNN 2016: 4664-4671 - 2015
- [c12]Jérémie Cabessa, Alessandro E. P. Villa:
Computational capabilities of recurrent neural networks based on their attractor dynamics. IJCNN 2015: 1-8 - [c11]Jérémie Cabessa, Jacques Duparc:
Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics. UCNC 2015: 144-156 - 2014
- [j5]Jérémie Cabessa, Hava T. Siegelmann:
The Super-Turing Computational Power of plastic Recurrent Neural Networks. Int. J. Neural Syst. 24(8) (2014) - [c10]Jérémie Cabessa, Alessandro E. P. Villa:
Interactive Evolving Recurrent Neural Networks Are Super-Turing Universal. ICANN 2014: 57-64 - 2013
- [c9]Jérémie Cabessa, Alessandro E. P. Villa:
The Super-Turing Computational Power of Interactive Evolving Recurrent Neural Networks. ICANN 2013: 58-65 - 2012
- [j4]Jérémie Cabessa, Hava T. Siegelmann:
The Computational Power of Interactive Recurrent Neural Networks. Neural Comput. 24(4): 996-1019 (2012) - [j3]Jérémie Cabessa, Alessandro E. P. Villa:
The expressive power of analog recurrent neural networks on infinite input streams. Theor. Comput. Sci. 436: 23-34 (2012) - [c8]Jérémie Cabessa:
Interactive Evolving Recurrent Neural Networks Are Super-turing. ICAART (1) 2012: 328-333 - [c7]Jérémie Cabessa, Alessandro E. P. Villa:
Recurrent Neural Networks - A Natural Model of Computation beyond the Turing Limits. IJCCI 2012: 594-599 - 2011
- [c6]Jérémie Cabessa, Hava T. Siegelmann:
Evolving recurrent neural networks are super-Turing. IJCNN 2011: 3200-3206 - [c5]Christian W. Bach, Jérémie Cabessa:
Agreeing to Disagree with Limit Knowledge. LORI 2011: 51-60 - 2010
- [c4]Jérémie Cabessa, Alessandro E. P. Villa:
A Hierarchical Classification of First-Order Recurrent Neural Networks. LATA 2010: 142-153
2000 – 2009
- 2009
- [j2]Jérémie Cabessa, Jacques Duparc:
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I. RAIRO Theor. Informatics Appl. 43(3): 443-461 (2009) - [j1]Jérémie Cabessa, Jacques Duparc:
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II. RAIRO Theor. Informatics Appl. 43(3): 463-515 (2009) - [c3]Jérémie Cabessa, Jacques Duparc, Alessandro Facchini, Filip Murlak:
The Wadge Hierarchy of Max-Regular Languages. FSTTCS 2009: 121-132 - [c2]Christian W. Bach, Jérémie Cabessa:
Limit knowledge of rationality. TARK 2009: 34-40 - 2008
- [c1]Jérémie Cabessa, Jacques Duparc:
The Algebraic Counterpart of the Wagner Hierarchy. CiE 2008: 100-109
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-08-03 20:15 CEST 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:
