Geodesic

Sommaire du Fascicule no. 1

The algorithm of angular superresolution using the cholesky decomposition and its implementation based on parallel computing technology
p. 6-19
Numerical modeling tools and $S$-derivatives
p. 20-29
Recursive-parallel algorithm for solving the graph-subgraph isomorphism problem
p. 30-43
LTL-specification of bounded counter machines
p. 44-59
Methods for change parallelism in process of high-level VLSI synthesis
p. 60-72

Sommaire du Fascicule no. 2

Application of election functions to estimate the number of monotone self-dual boolean functions
p. 78-91
On some estimate for the norm of an interpolation projector
p. 92-103
Enumeration degrees of the bounded sets
p. 104-114
Neural network-based sentiment classification of Russian sentences into four classes
p. 116-133
Recursive sentiment detection algorithm for Russian sentences
p. 134-147

Sommaire du Fascicule no. 3

Research of models of topological relations of spatial objects
p. 154-165
Two-step colouring of grid graphs of different types
p. 166-180
On the construction of self-complementary codes and their application in the problem of information hiding
p. 182-198
Formation of machine learning features based on the construction of tropical functions
p. 200-209
Testing dependencies and inference rules in databases
p. 210-227
Towards neural routing with verified bounds on performance
p. 228-245
Transformation of C programming language memory model into object-oriented representation of EO language
p. 246-264
Classification of articles from mass media by categories and relevance of the subject area
p. 266-279

Sommaire du Fascicule no. 4

Analysis of students' academic performance using LMS event logs
p. 286-314
Detecting mentions of green practices in social media based on text classification
p. 316-332
Classification of russian texts by genres based on modern embeddings and rhythm
p. 334-347
A model for automated business writing assessment
p. 348-365
Remarks on the reachability graphs of Petri nets
p. 366-371
The polynomial algorithm of finding the shortest path in a divisible multiple graph
p. 372-387