1.1k citations
- Institute for Basic ScienceKR31 papers
- Seoul National UniversityKR26 papers
- Yonsei UniversityKR25 papers
- Korea Institute for Advanced StudyKR22 papers
- Inje UniversityKR19 papers
- Hanyang UniversityKR16 papers
- Asia Pacific Center for Theoretical PhysicsKR14 papers
- Kwangwoon UniversityKR14 papers
- Pohang University of Science and TechnologyKR14 papers
- Ewha Womans UniversityKR13 papers
- Kyoto UniversityJP12 papers
- Sejong UniversityKR11 papers
15 papers · 1 filter
Representations of degenerate poly-Bernoulli polynomials
Taekyun Kim, Dae San Kim, Jongkyum Kwon +1
As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polyloga…
A Survey on Churn Analysis
Jaehuyn Ahn
In this paper, I present churn prediction techniques that have been released so far. Churn prediction is used in the fields of Internet services, games, insurance, and management.…
Painting Outside as Inside: Edge Guided Image Outpainting via Bidirectional Rearrangement with Progressive Step Learning
Kyunghun Kim, Yeohun Yun, Keon-Woo Kang +3
Image outpainting is a very intriguing problem as the outside of a given image can be continuously filled by considering as the context of the image. This task has two main challen…
Polytypism in Few-Layer Gallium Selenide
Soo Yeon Lim, Jae-Ung Lee, Jung Hwa Kim +6
Gallium selenide (GaSe) is one of layered group-III metal monochalcogenides, which has an indirect bandgap in monolayer and direct bandgap in bulk unlike other conventional transit…
Identities on poly-Dedekind sums
Taekyun Kim, Dae san Kim, Hyunseok Lee +1
Dedekind sums occur in the transformation behaviour of the logarithm of the Dedekind eta-function under substitutions from the modular group. In 1892, Dedekind showed a reciprocity…
An Index-based Deterministic Asymptotically Optimal Algorithm for Constrained Multi-armed Bandit Problems
Hyeong Soo Chang
For the model of constrained multi-armed bandit, we show that by construction there exists an index-based deterministic asymptotically optimal algorithm. The optimality is achieved…