Maxim Zhiganov has been exploring different aspects of sound for many years—first in relation to his native Perm and then on a broader, global scale. In this interview for the HSE Young Scientists project, he talks about sound maps, the special issue of the journal Logos, and why it is important to make the familiar less clear and obvious.
Neural networks are no longer simple travel assistants; now they decide what to include on the route and what to skip. Artificial intelligence changes how people perceive a place and shapes the image of tourist centres. At the II International Scientific and Practical Conference ’Information Technologies in the Preservation and Promotion of Cultural Heritage,’ researchers discussed who controls algorithmic solutions and in what ways, and whether authentic traditions get lost in them.
Worldwide, road injuries are the leading cause of death among males aged 10–39. An international team of researchers reached this conclusion as part of the Global Burden of Disease Study 2023, analysing data from 204 countries between 1990 and 2023. Their findings have been published in The Lancet Public Health, with HSE University Professor Vasily Vlassov listed among the collaborators.
Chistopolskaia A., Podolskii V. V., Theory of Computing Systems 2022
In this paper we study decision tree models with various types of queries. For a given function it is usually not hard to determine the complexity in the standard decision tree model (each query evaluates a variable). However in more general settings showing tight lower bounds is substantially harder. Threshold functions often have non-trivial complexity ...
Chistopolskaia A., Podolskii V. V., , in: Computer Science – Theory and Applications 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, ProceedingsVol. 12159.: Springer, 2020. P. 198–210.
In this paper we study decision tree models with various types of queries. For a given function it is usually not hard to determine the complexity in the standard decision tree model (each query evaluates a variable). However in more general settings showing tight lower bounds is substantially harder. Threshold functions often have non-trivial complexity ...
Chirkov A., Zolotykh N., Graphs and Combinatorics 2016 Vol. 32 No. 5 P. 1789–1803
An integer point in a polyhedron is called irreducible iff it is not the midpoint of two other integer points in the polyhedron. We prove that the number of irreducible integer points in n-dimensional polytope P is at most O(m⌊n2⌋logn−1γ), where n is fixed and P is given by a system of m linear inequalities with integer coefficients not exceeding (by absolute value) γ. This bound ...