#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Lev Bogolubsky, Pavel Dvurechensky, +5 authors Maksim Zhukovskii
- NIPS
- 2016

In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for features of nodes and edges. We propose gradient-based and random gradient-free methods to solve this problem. Our algorithms are based on the concept of an inexact oracle and unlike the state-of-the-art gradient-based method we… (More)

- Maksim Zhukovskii, Gleb Gusev, Pavel Serdyukov
- ECIR
- 2013

Let C be a class of graphs and π be a graph parameter. Let Φ be a formula in the first-order language containing only the adjacency and the equality relations. We say that Φ defines C on connected graphs with sufficiently large π if there is a constant k such that, for every connected graph G with π(G) ≥ k, Φ is true on G exactly when G belongs to C. For a… (More)

- V. I. Starichenko, M. V. Zhukovskii
- Russian Journal of Ecology
- 2012

The relationship between 90Sr accumulation in the skeleton after single injection and the resulting dose load on bone surfaces was studied in laboratory mice. Radiation doses were measured by a thermoluminescent method. A positive correlation was revealed between the surface dose rate on the skull and mandible and 90Sr specific radioactivity in these bones.… (More)

In the paper we investigate power law for PageRank components for the Buckley-Osthus model for web graph. We compare different numerical methods for PageRank calculation. With the best method we do a lot of numerical experiments. These experiments confirm the hypothesis about power law. At the end we discuss real model of web-ranking based on the classical… (More)

- Oleg Verbitsky, Maksim Zhukovskii
- ArXiv
- 2016

Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic. The recognition problem of $I(F)$, known as Induced Subgraph Isomorphism (for the pattern graph $F$), is solvable in time $O(n^{W[F]})$. Motivated by this fact, we are… (More)

- Maksim Zhukovskii
- Discrete Mathematics
- 2012

- ‹
- 1
- ›