default search action
Corneliu A. Marinov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Corneliu A. Marinov, Ruxandra-Liana Costea
:
Designing a Winner-Loser Gap for WTA in Subthreshold. Resolution Performance Revisited. Circuits Syst. Signal Process. 41(12): 7145-7171 (2022) - [j10]Corneliu A. Marinov, Ruxandra-Liana Costea
Correction to: Designing a Winner-Loser Gap for WTA in Subthreshold. Resolution Performance Revisited. Circuits Syst. Signal Process. 41(12): 7172-7173 (2022)
2010 – 2019
- 2016
- [j9]Ruxandra-Liana Costea, Corneliu A. Marinov:
A Consistent Model for Lazzaro Winner-Take-All Circuit With Invariant Subthreshold Behavior. IEEE Trans. Neural Networks Learn. Syst. 27(11): 2375-2385 (2016) - 2012
- [c8]Corneliu A. Marinov, Ruxandra-Liana Costea, Victor E. Bucata:
On the invariance of Lazzaro circuit model. MWSCAS 2012: 1188-1191 - 2011
- [j8]Ruxandra-Liana Costea, Corneliu A. Marinov:
New Accurate and Flexible Design Procedure for a Stable KWTA Continuous Time Network. IEEE Trans. Neural Networks 22(9): 1357-1367 (2011) - [c7]Ruxandra-Liana Costea, Corneliu A. Marinov:
Continuous time recurrent neural network designed for KWTA operation. IJCNN 2011: 86-89 - [c6]Ruxandra-Liana Costea, Corneliu A. Marinov:
Recurrent neural network as a KWTA selector: A synthesis procedure. ISCAS 2011: 1093-1096 - 2010
- [j7]Corneliu A. Marinov, Ruxandra-Liana Costea:
Time-Oriented Synthesis for a WTA Continuous-Time Neural Network Affected by Capacitive Cross-Coupling. IEEE Trans. Circuits Syst. I Regul. Pap. 57-I(6): 1358-1370 (2010)
2000 – 2009
- 2008
- [c5]Ruxandra-Liana Costea, Corneliu A. Marinov:
Time Evaluation for WTA Hopfield Type Circuits Affected by Cross-Coupling Capacitances. ICONIP (2) 2008: 885-892 - 2007
- [c4]Ruxandra-Liana Costea, Corneliu A. Marinov:
Clocking and WTA design of a continuous time Hopfield net with parasitic capacitances. ECCTD 2007: 396-399 - 2005
- [j6]Corneliu A. Marinov, John J. Hopfield:
Stable computational dynamics for a class of circuits with O(N) interconnections capable of KWTA and rank extractions. IEEE Trans. Circuits Syst. I Regul. Pap. 52-I(5): 949-959 (2005) - 2003
- [j5]Corneliu A. Marinov, Bruce D. Calvert:
Performance analysis for a K-winners-take-all analog neural network: basic theory. IEEE Trans. Neural Networks 14(4): 766-780 (2003) - 2000
- [j4]Bruce D. Calvert, Corneliu A. Marinov:
Another K-winners-take-all analog neural network. IEEE Trans. Neural Networks Learn. Syst. 11(4): 829-838 (2000) - [c3]Bruce D. Calvert, Corneliu A. Marinov:
A k-winners-take-all neural net. CDC 2000: 3547-3549
1990 – 1999
- 1996
- [j3]P. N. Shivakumar, Joseph J. Williams, Qiang Ye, Corneliu A. Marinov:
On Two-Sided Bounds Related to Weakly Diagonally Dominant M-Matrices with Application to Digital Circuit Dynamics. SIAM J. Matrix Anal. Appl. 17(2): 298-312 (1996) - 1994
- [c2]Corneliu A. Marinov, Jukka-Pekka Santanen:
Iterative Waveform Relaxation Bounds for General RC Circuits. ISCAS 1994: 149-152 - 1993
- [c1]Corneliu A. Marinov, Pekka Neittaanmäki:
Bounds for Distributed Parameter Trees. ISCAS 1993: 1551-1554 - 1990
- [j2]Corneliu A. Marinov, Pekka Neittaanmäki:
A delay time bound for distributed parameter circuits with bipolar transistors. Int. J. Circuit Theory Appl. 18(1): 99-106 (1990) - [j1]Corneliu A. Marinov:
Dissipativity as a unified approach to sandberg-willson-type properties of non-linear transistor networks. Int. J. Circuit Theory Appl. 18(6): 577-594 (1990)
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-04-25 05:46 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: