A. V. Medvedev, A. G. Dyakonov, “Towards efficient learning of GNN on high-dimensional multi-layered representations of tabular data”, Dokl. RAN. Math. Inf. Proc. Upr., 514:2 (2023), 118–125; Dokl. Math., 108:suppl. 2 (2023), S265–S271
2.
R. L. Vasilev, A. G. Dyakonov, “Deep metric learning: loss functions comparison”, Dokl. RAN. Math. Inf. Proc. Upr., 514:2 (2023), 60–71; Dokl. Math., 108:suppl. 2 (2023), S215–S225
3.
P. D. Shtykov, A. G. Dyakonov, “A generalized dialogue graph construction and visualization based on a corpus of dialogues”, Prikl. Diskr. Mat., 2023, no. 59, 111–127
2020
4.
A. G. Dyakonov, A. M. Golovina, “Completeness criteria for a linear model of classification algorithms with respect to families of decision rules”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020), 67–70; Dokl. Math., 101:1 (2020), 57–59
2014
5.
S. V. Ablameyko, A. S. Biryukov, A. A. Dokukin, A. G. D'yakonov, Yu. I. Zhuravlev, V. V. Krasnoproshin, V. A. Obraztsov, M. Yu. Romanov, V. V. Ryazanov, “Practical algorithms for algebraic and logical correction in precedent-based recognition problems”, Zh. Vychisl. Mat. Mat. Fiz., 54:12 (2014), 1979–1993; Comput. Math. Math. Phys., 54:12 (2014), 1915–1928
A. G. Dyakonov, “Criteria for the singularity of a pairwise $l_1$-distance matrix and their generalizations”, Izv. RAN. Ser. Mat., 76:3 (2012), 93–110; Izv. Math., 76:3 (2012), 517–534
2011
7.
A. G. D'yakonov, “Theory of equivalence systems for describing algebraic closures of a generalized estimation model. II”, Zh. Vychisl. Mat. Mat. Fiz., 51:3 (2011), 529–544; Comput. Math. Math. Phys., 51:3 (2011), 490–504
A. G. D'yakonov, “Theory of equivalence systems for the description of algebraic closures in a generalized model for the computation of estimates”, Zh. Vychisl. Mat. Mat. Fiz., 50:2 (2010), 388–400; Comput. Math. Math. Phys., 50:2 (2010), 369–381
A. G. D'yakonov, “Algebra over estimation algorithms: Normalization with respect to the interval”, Zh. Vychisl. Mat. Mat. Fiz., 49:1 (2009), 200–208; Comput. Math. Math. Phys., 49:1 (2009), 194–202
A. G. D'yakonov, “Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes”, Zh. Vychisl. Mat. Mat. Fiz., 48:5 (2008), 916–927; Comput. Math. Math. Phys., 48:5 (2008), 866–876
A. G. D'yakonov, “Codings and their use in the DNF implementation of binary functions”, Zh. Vychisl. Mat. Mat. Fiz., 44:8 (2004), 1511–1520; Comput. Math. Math. Phys., 44:8 (2004), 1435–1444
2003
15.
A. G. D'yakonov, “Construction of disjunctive normal forms by consecutive multiplication”, Zh. Vychisl. Mat. Mat. Fiz., 43:10 (2003), 1589–1600; Comput. Math. Math. Phys., 43:10 (2003), 1529–1540
A. G. D'yakonov, “Construction of disjunctive normal forms in algorithms of pattern recognition”, Zh. Vychisl. Mat. Mat. Fiz., 42:12 (2002), 1899–1907; Comput. Math. Math. Phys., 42:12 (2002), 1824–1832
A. G. D'yakonov, “Test approach to the implementation of Boolean functions with few zeros by disjunctive normal forms”, Zh. Vychisl. Mat. Mat. Fiz., 42:6 (2002), 924–928; Comput. Math. Math. Phys., 42:6 (2002), 889–893
A. G. D'yakonov, “Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms”, Zh. Vychisl. Mat. Mat. Fiz., 41:5 (2001), 821–828; Comput. Math. Math. Phys., 41:5 (2001), 775–782
A. G. D'yakonov, “On the choice of a system of support sets for an efficient implementation of recognition algorithms of the estimate-computing type”, Zh. Vychisl. Mat. Mat. Fiz., 40:7 (2000), 1104–1118; Comput. Math. Math. Phys., 40:7 (2000), 1060–1074
A. G. D'yakonov, “Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets”, Zh. Vychisl. Mat. Mat. Fiz., 39:11 (1999), 1904–1918; Comput. Math. Math. Phys., 39:11 (1999), 1829–1843
Contact us: