#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- A. Markhasin, A. Kolpakov, V. Drozdova
- 2007 3rd IEEE/IFIP International Conference in…
- 2007

Abstract -In this paper, we present optimization tasks of the spectral and power efficiency of the m-ary channels' in wireless and mobile networks. The invariant efficiency criterions based on the m-ary digital channel's Shannon capacity are introduced. Two invariant fundamental resources efficiency optimums are investigated: first - the maximum spectral… (More)

- Alexander Kolpakov
- Eur. J. Comb.
- 2012

A connection between real poles of the growth functions for Coxeter groups acting on hyperbolic space of dimensions three and greater and algebraic integers is investigated. In particular, a certain geometric convergence of fundamental domains for cocompact hyperbolic Coxeter groups with finite-volume limiting polyhedron provides a relation between Salem… (More)

We introduce an algorithm which transforms every four-dimensional cubulation into a cusped finite-volume hyperbolic four-manifold. Combinatorially distinct cubulations give rise to topologically distinct manifolds. Using this algorithm we construct the first examples of finite-volume hyperbolic four-manifolds with one cusp. More generally, we show that the… (More)

- G I Vorob'ev, T S Odariuk, P V Tsar'kov, I N Kabanova, A P Tupikova, A V Kolpakov
- Khirurgiia
- 2000

The aim of this study was to evaluate short- and long-term results of sphincter preserving operations with forming a colonic J-reservoir. This study examined the results of the treatment of 63 patients with medioampullary carcinoma of the rectum. Sphincter preserving operations with forming a reservoiroanal anastomosis were made in 34 patients (test group),… (More)

- A. Kolpakov
- 2003

—Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.

- A A Taranov, A V Kolpakov, I N Spiridonov
- Meditsinskaia tekhnika
- 2011

On the optimality of the ideal right-angled 24-cell ALEXANDER KOLPAKOV We prove that among four-dimensional ideal right-angled hyperbolic polytopes the 24-cell is of minimal volume and of minimal facet number. As a corollary, a dimension bound for ideal right-angled hyperbolic polytopes is obtained. 1 Introduction In this work, we consider the 24-cell C ,… (More)

We suggest a method of computing volume for a simple polytope P in three-dimensional hyperbolic space H 3. This method combines the combinatorial reduction of P as a trivalent graph Γ (the 1-skeleton of P) by I − H, or Whitehead, moves (together with shrinking of triangular faces) aligned with its geometric splitting into generalised tetra-hedra. With each… (More)

- ‹
- 1
- ›