|
|
|
Publications in Math-Net.Ru |
Citations |
|
2014 |
| 1. |
N. G. Zagoruyko, V. V. Tatarnikov, “Detecting mistakes and filling gaps in data cubes”, Sib. Zh. Ind. Mat., 17:2 (2014), 50–58   ; J. Appl. Industr. Math., 8:3 (2014), 444–451 |
1
|
|
2013 |
| 2. |
N. G. Zagoruiko, I. A. Borisova, O. A. Kutnenko, V. V. Dyubanov, “Constructing the compressed description of dataset by the function of rival similarity”, Sib. Zh. Ind. Mat., 16:1 (2013), 29–41 ; J. Appl. Industr. Math., 7:2 (2013), 275–286 |
8
|
|
2010 |
| 3. |
N. G. Zagoruĭko, I. A. Borisova, V. V. Dyubanov, O. A. Kutnenko, “A quantitative measure of compactness and similarity in competitive space”, Sib. Zh. Ind. Mat., 13:1 (2010), 59–71 ; J. Appl. Industr. Math., 5:1 (2011), 144–154 |
14
|
|
2006 |
| 4. |
N. G. Zagoruiko, V. V. Dyubanov, “The family of algorithms LOKATOR for the fast search for the closest analogue”, Sib. Zh. Ind. Mat., 9:4 (2006), 64–74 |
|
2004 |
| 5. |
N. G. Zagoruiko, O. A. Kutnenko, “Recognition methods based on the algorithm AdDel”, Sib. Zh. Ind. Mat., 7:1 (2004), 39–47  |
1
|
|
2001 |
| 6. |
A. N. Vashchenko, E. E. Vityaev, N. G. Zagoruiko, A. A. Mal'tsev, N. N. Nepeivoda, D. E. Pal'chunov, S. G. Pyrkin, A. V. Tkachev, “Рефлексирующие программные системы”, Sib. Zh. Ind. Mat., 4:1 (2001), 22–28 |
|
2000 |
| 7. |
N. G. Zagoruiko, G. S. Lbov, “The choice problem in data analysis and control theory”, Sib. Zh. Ind. Mat., 3:1 (2000), 101–109 |
1
|
|
1998 |
| 8. |
N. G. Zagoruiko, “Compactness and $\lambda$-compactness hypotheses in data analysis methods”, Sib. Zh. Ind. Mat., 1:1 (1998), 114–126 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: