Results 1 to 10 of about 858,425 (150)

Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem

open access: yesМоделирование и анализ информационных систем, 2023
The paper proposes an algorithm for solving the problem of finding the maximum common subgraph. Both the sequential and the parallel version of the algorithm, their software implementation are described, and an experimental study of their effectiveness ...
Vladimir V. Vasilchikov
doaj   +1 more source

Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem

open access: yesМоделирование и анализ информационных систем, 2022
The paper proposes a parallel algorithm for solving the Graph-Subgraph Isomorphism Problem and makes an experimental study of its efficiency. The problem is one of the most famous NP-complete problems.
Vladimir V. Vasilchikov
doaj   +1 more source

Corrigendum to: V. V. Vasilchikov, “Parallel Algorithm for Solving the Graph Isomorphism Problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86–94, 2020. DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94

open access: yesМоделирование и анализ информационных систем, 2021
In the article by V. V. Vasilchikov “Parallel Algorithm for Solving the Graph Isomorphism Problem” ( Modeling and analysis of information systems, vol. 27, no. 1, pp. 86–94, 2020; DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94) there was a misprint
Vladimir Vasilyevich Vasilchikov
doaj   +1 more source

Comparative analysis of selected object-relational mapping systems for the .NET platform

open access: yesJournal of Computer Sciences Institute, 2020
This article is devoted to the comparison of two object-relational mapping systems supported by .NET platform - Entity Framework Core and NHibernate.
Krzysztof Drzazga   +2 more
doaj   +1 more source

Conformal Nets I: Coordinate-Free Nets [PDF]

open access: yesInternational Mathematics Research Notices, 2014
We describe a coordinate-free perspective on conformal nets, as functors from intervals to von Neumann algebras. We discuss an operation of fusion of intervals and observe that a conformal net takes a fused interval to the fiber product of von Neumann algebras.
Bartels, A, Douglas, C, Henriques, A
openaire   +2 more sources

CNN Architectures: Alex Net, Le Net, VGG, Google Net, Res Net

open access: yesInternational Journal of Recent Technology and Engineering (IJRTE), 2020
Convolutional Neural Networks(CNNs) are a floating area in Deep Learning. Now a days CNNs are used inside the more note worthy some portion of the Object Recognition tasks. It is used in stand-out utility regions like Speech Recognition, Pattern Acknowledgment, Computer Vision, Object Detection and extraordinary photograph handling programs. CNN orders
M. Swapna   +2 more
openaire   +1 more source

Parallel Algorithm for Solving the Graph Isomorphism Problem

open access: yesМоделирование и анализ информационных систем, 2020
In this paper, we offer an efficient parallel algorithm for solving the Graph Isomorphism Problem. Our goal is to construct a suitable vertex substitution or to prove the absence of such.
Vladimir Vasilyevich Vasilchikov
doaj   +1 more source

NET Confusion [PDF]

open access: yesFrontiers in Immunology, 2016
Neutrophils are arguably the most important white blood cell for defense against bacterial and fungal infections. These leukocytes are produced in high numbers on a daily basis in humans and are recruited rapidly to injured/infected tissues. Phagocytosis and subsequent intraphagosomal killing and digestion of microbes have historically been the ...
Malachowa, Natalia   +3 more
openaire   +2 more sources

Sequence nets

open access: yesPhysical Review E, 2008
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary alphabet might generate threshold nets in a similar fashion [Hagberg et al., Phys. Rev. E 74, 056116 (2006)].
Sun, Jie   +2 more
openaire   +3 more sources

On а Recursive-Parallel Algorithm for Solving the Knapsack Problem

open access: yesМоделирование и анализ информационных систем, 2018
In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category ”branch and bound methods” have long been used.
Vladimir V. Vasilchikov
doaj   +1 more source

Home - About - Disclaimer - Privacy