Zobrazeno 1 - 10
of 122
pro vyhledávání: '"Sergey Bereg"'
Autor:
Timothy Rozario, Tsuicheng D. Chiu, Mingli Chen, Xun Jia, Weiguo Lu, Sergey Bereg, Weihua Mao
Publikováno v:
Applied Sciences, Vol 8, Iss 12, p 2525 (2018)
A novel method was developed to track lung tumor motion in real time during radiation therapy with the purpose to allow target radiation dose escalation while simultaneously reducing the dose to sensitive structures, thereby increasing local control
Externí odkaz:
https://doaj.org/article/d0d94ea440c949e48b73dae86b826d72
Autor:
Sergey Bereg, Mohammadreza Haghpanah
Publikováno v:
Discrete Applied Mathematics. 319:194-206
Autor:
Sergey Bereg, Mohammadreza Haghpanah
Publikováno v:
Discrete Applied Mathematics. 319:207-215
Publikováno v:
Designs, Codes and Cryptography. 90:1659-1677
Publikováno v:
Applied Mathematics and Computation
The term melodic template or skeleton refers to a basic melody which is subject to variation during a music performance. In many oral music tradition, these templates are implicitly passed throughout generations without ever being formalized in a sco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ecd90d4a131110f7ae254b01014f38d
http://arxiv.org/abs/2209.13598
http://arxiv.org/abs/2209.13598
Autor:
Sergey Bereg, Mohammadreza Haghpanah
Publikováno v:
Discrete Applied Mathematics. 283:596-603
Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em Tverberg pa
Publikováno v:
Electronic Journal of Graph Theory and Applications. 10:575
Publikováno v:
Theoretical Computer Science. 786:26-31
Given a set of n points Q in the plane, each colored with one of the k given colors, a color-spanning set S ⊂ Q is a subset of k points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is m
Autor:
Peter J. Dukes, Sergey Bereg
Publikováno v:
Designs, Codes and Cryptography. 88:63-72
A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length n and minimum distance $$n-1$$. When such codes of length $$p+1$$ are included as ingredients,