default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail V. Kiselev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Mikhail V. Kiselev, Andrey Lavrentyev, Denis A. Larionov, Dmitry A. Ivanov:
From "What" to "When" - a Spiking Neural Network Predicting Rare Events and Time to their Occurrence. IJCNN 2024: 1-8- 2023
- [c15]Mikhail V. Kiselev
, Alexander Ivanitsky, Andrey Lavrentyev:
A Spiking Neural Network Learning Markov Chain. IJCNN 2023: 1-8
2010 – 2019
- 2019
- [c14]Mikhail V. Kiselev, Andrey Lavrentyev:
A Preprocessing Layer in Spiking Neural Networks - Structure, Parameters, Performance Criteria. IJCNN 2019: 1-9 - 2017
- [c13]Mikhail V. Kiselev:
A synaptic plasticity rule providing a unified approach to supervised and unsupervised learning. IJCNN 2017: 3806-3813 - 2016
- [c12]Mikhail V. Kiselev:
Rate coding vs. temporal coding - is optimum between? IJCNN 2016: 1355-1359 - [c11]Mikhail V. Kiselev:
Conversion from Rate Code to Temporal Code - Crucial Role of Inhibition. ISNN 2016: 665-672 - 2014
- [j1]Mikhail V. Kiselev:
Homogenous Chaotic Network Serving as a Rate/Population Code to Temporal Code Converter. Comput. Intell. Neurosci. 2014: 476580:1-476580:8 (2014) - [c10]Mikhail V. Kiselev:
Input-output Characteristics of LIF Neuron with Dynamic Threshold and Short Term Synaptic Depression. ANNIIP 2014: 11-18 - [c9]Mikhail V. Kiselev:
Empirical Models as a Basis for Synthesis of Large Spiking Neural Networks with Pre-Specified Properties. IJCCI (NCTA) 2014: 264-269 - 2013
- [c8]Mikhail V. Kiselev:
Self-Organization Process in Large Spiking Neural Networks Leading to Formation of Working Memory Mechanism. IWANN (1) 2013: 510-517 - 2011
- [c7]Mikhail V. Kiselev:
Self-organized Short-Term Memory Mechanism in Spiking Neural Network. ICANNGA (1) 2011: 120-129
2000 – 2009
- 2009
- [c6]Mikhail V. Kiselev:
Self-organized spiking neural network recognizing phase/frequency correlations. IJCNN 2009: 1633-1639
1990 – 1999
- 1999
- [c5]Mikhail V. Kiselev, Sergei M. Ananyan, Sergei B. Arseniev:
LA - A Clustering Algorithm with an Automated Selection of Attributes, wich is Invariant to Functional Transformations of Coordinates. PKDD 1999: 366-371 - 1998
- [c4]Mikhail V. Kiselev, Sergei M. Ananyan, Sergei B. Arseniev:
PolyAnalyst Data Analysis Technique and Its Specialization for Processing Data Organized as a Set of Attribute Values. PKDD 1998: 352-360 - 1997
- [c3]Mikhail V. Kiselev, Sergei M. Ananyan, Sergei B. Arseniev:
Regression-Based Classification Methods and Their Comparisons with Desision Tree Algorithms. PKDD 1997: 134-144 - 1994
- [c2]Mikhail V. Kiselev:
PolyAnalyst - A Machine Discovery System Inferring Functional Programs. KDD Workshop 1994: 237-250 - 1991
- [c1]Sergei B. Arseniev, Mikhail V. Kiselev:
The Object-Oriented Approach to the Medical Real Time System Design. MIE 1991: 508-512
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-10-07 22:13 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:
