default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Kryzhanovsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c15]Vladimir Kryzhanovsky, Magomed Malsagov:
Distorted High-Dimensional Binary Patterns Search by Scalar Neural Network Tree. AIST 2015: 208-217- 2014
- [c14]Irina Zhelavskaya, Vladimir Kryzhanovsky, Magomed Malsagov:
Error Probability for Scalar Neural Network Trees in High-Dimensional Binary Space. BICT 2014 - [c13]Vladimir Kryzhanovsky, Magomed Malsagov, Juan Antonio Clares Tomas, Irina Zhelavskaya
:
High-Dimensional Binary Pattern Classification by Scalar Neural Network Tree. ICANN 2014: 169-176 - [c12]Vladimir Kryzhanovsky, Magomed Malsagov, Juan Antonio Clares Tomas, Irina Zhelavskaya:
On Error Probability of Search in High-Dimensional Binary Space with Scalar Neural Network Tree. IJCCI (NCTA) 2014: 300-305 - 2013
- [c11]Vladimir Kryzhanovsky, Irina Zhelavskaya, Juan Antonio Clares Tomas:
Two-Layer Vector Perceptron. ICANN 2013: 42-49 - 2012
- [c10]Vladimir Kryzhanovsky, Irina Zhelavskaya, Jakov Karandashev:
Binary Perceptron Learning Algorithm Using Simplex-Method. ICAISC (1) 2012: 111-118 - [c9]Vladimir Kryzhanovsky, Irina Zhelavskaya, Anatoly B. Fonarev:
Vector Perceptron Learning Algorithm Using Linear Programming. ICANN (2) 2012: 197-204 - 2011
- [c8]Vladimir Kryzhanovsky:
Binary Patterns Identification by Vector Neural Network with Measure of Proximity between Neuron States. ICANN (2) 2011: 119-126 - [c7]Vladimir Kryzhanovsky:
Identification of Correlated Patterns by Vector Perceptron with Binarized Synaptic Coefficients. IJCCI (NCTA) 2011: 351-357 - 2010
- [p1]Boris Kryzhanovsky, Vladimir Kryzhanovsky, Leonid B. Litinskii:
Machine Learning in Vector Models of Neural Networks. Advances in Machine Learning II 2010: 427-443
2000 – 2009
- 2009
- [c6]Vladimir Kryzhanovsky:
Pattern Identification by Committee of Potts Perceptrons. ICANN (1) 2009: 844-853 - 2008
- [c5]Boris Kryzhanovsky, Vladimir Kryzhanovsky:
Binary Optimization: On the Probability of a Local Minimum Detection in Random Search. ICAISC 2008: 89-100 - [c4]Vladimir Kryzhanovsky:
Modified q-State Potts Model with Binarized Synaptic Coefficients. ICANN (2) 2008: 72-80 - [c3]Vladimir Kryzhanovsky, Boris Kryzhanovsky, Anatoly B. Fonarev:
Application of Potts-Model Perceptron for Binary Patterns Identification. ICANN (1) 2008: 553-561 - 2007
- [c2]Boris Kryzhanovsky, Vladimir Kryzhanovsky, A. L. Mikaelian:
Binary optimization: A relation between the depth of a local minimum and the probability of its detection. ICINCO-ICSO 2007: 5-10 - 2006
- [c1]Vladimir Kryzhanovsky, Bashir M. Magomedov, Anatoly B. Fonarev, Boris Kryzhanovsky:
Domain Dynamics in Hopfield Model. IJCNN 2006: 3249-3253 - 2004
- [i1]D. I. Alieva, Boris Kryzhanovsky, Vladimir Kryzhanovsky, Anatoly B. Fonarev:
Q-valued neural network as a system of fast identification and pattern recognition. CoRR abs/cs/0412110 (2004)
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-24 22:50 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:
