default search action
Yakov M. Karandashev
Person information
- affiliation: Center of Optical Neural Technologies SRISA RAS, Moscow
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j3]A. S. Markov, E. Yu. Kotlyarov, N. P. Anosova, V. A. Popov, Yakov M. Karandashev, Darya E. Apushkinskaya:
Using Neural Networks to Detect Anomalies in X-Ray Images Obtained with Full-Body Scanners. Autom. Remote. Control. 83(10): 1507-1516 (2022) - 2020
- [i5]Magomed Yu. Malsagov, Emil M. Khayrov, Maria M. Pushkareva, Iakov M. Karandashev:
Exponential discretization of weights of neural network connections in pre-trained neural networks. CoRR abs/2002.00623 (2020)
2010 – 2019
- 2019
- [c12]Iakov M. Karandashev
, Boris Kryzhanovsky
Global Minimum Depth in Edwards-Anderson Model. EANN 2019: 391-398 - [c11]Magomed Yu. Malsagov, Iakov M. Karandashev
Approximation of Edwards-Anderson Spin-Glass Model Density of States. ISNN (2) 2019: 173-179 - 2018
- [j2]Boris Kryzhanovsky
Investigation of Finite-Size 2D Ising Model with a Noisy Matrix of Spin-Spin Interactions. Entropy 20(8): 585 (2018) - [c10]Boris V. Kryzhanovsky, Iakov M. Karandashev
Dependence of Critical Temperature on Dispersion of Connections in 2D Grid. ISNN 2018: 695-702 - 2016
- [i4]Yakov M. Karandashev, Magomed Yu. Malsagov:
Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs. CoRR abs/1611.00922 (2016) - 2014
- [c9]Iakov M. Karandashev
Mix-Matrix Transformation Method for Max-Сut Problem. ICANN 2014: 323-330 - 2013
- [j1]Iakov M. Karandashev
Increasing the attraction area of the global minimum in the binary optimization problem. J. Glob. Optim. 56(3): 1167-1185 (2013) - 2012
- [c8]Iakov M. Karandashev
Elimination of a Catastrophic Destruction of a Memory in the Hopfield Model. EANN 2012: 1-10 - [c7]Vladimir Kryzhanovsky, Irina Zhelavskaya
Binary Perceptron Learning Algorithm Using Simplex-Method. ICAISC (1) 2012: 111-118 - [c6]Iakov M. Karandashev
Properties of the Hopfield Model with Weighted Patterns. ICANN (1) 2012: 9-16 - [c5]Iakov M. Karandashev
The Mix-Matrix Method in the Problem of Binary Quadratic Optimization. ICANN (1) 2012: 41-48 - [i3]Yakov M. Karandashev, Boris Kryzhanovsky, Leonid B. Litinskii:
Weighted Patterns as a Tool for Improving the Hopfield Model. CoRR abs/1205.0908 (2012) - 2011
- [c4]Iakov M. Karandashev
Transformation of Edge Weights in a Graph Bipartitioning Problem. ICANN (2) 2011: 25-31 - 2010
- [c3]Yakov M. Karandashev
Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix. ICANN (3) 2010: 41-51 - [c2]Yakov M. Karandashev
Binary Minimization: Increasing the Attraction Area of the Global Minimum in the Binary Optimization Problem. ICANN (2) 2010: 525-530 - [c1]Iakov M. Karandashev
Efficient energy landscape transformation in the problem of binary minimization. IJCNN 2010: 1-6 - [i2]Yakov M. Karandashev, Boris Kryzhanovsky, Leonid B. Litinskii:
Local Minima of a Quadratic Binary Functional with Quasi-Hebbian Connection Matrix. CoRR abs/1005.4285 (2010) - [i1]Yakov M. Karandashev, Boris Kryzhanovsky, Leonid B. Litinskii:
Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix. CoRR abs/1012.4981 (2010)
Coauthor Index
aka: Boris V. Kryzhanovsky
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 23:08 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: