Hae-Sung Eom

13 papers Journal 5Unranked 8
YearRankTypeTitle / Venue / Authors
2016 — conf
Combined operations on prefix-free and suffix-free languages.
NCMA
Hae-Sung Eom, Matús Palmovský
2016 J jnl
Operational State Complexity of Subtree-Free Regular Tree Languages.
Int. J. Found. Comput. Sci.
Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han
2016 J jnl
State Complexity of Basic Operations on Non-Returning Regular Languages.
Fundam. Informaticae
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
2015 J jnl
State Complexity of
Int. J. Found. Comput. Sci.
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa
2015 J jnl
State Complexity of Boundary of Prefix-Free Regular Languages.
Int. J. Found. Comput. Sci.
Hae-Sung Eom, Yo-Sub Han
2014 — conf
State Complexity of Combined Operations for Prefix-Free Regular Languages.
Discrete Mathematics and Computer Science
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu
2013 — conf
State Complexity of Basic Operations on Non-returning Regular Languages.
DCFS
Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
2013 — conf
State Complexity of Subtree-Free Regular Tree Languages.
DCFS
Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko
2013 — conf
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages.
DCFS
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa
2013 J jnl
State complexity of combined operations for suffix-free regular languages.
Theor. Comput. Sci.
Hae-Sung Eom, Yo-Sub Han
2012 — conf
A recommendation system based on a subset of raters.
ICUIMC
Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han
2011 — conf
A Smart Movie Recommendation System.
HCI (11)
Sang-Ki Ko, Sang-Min Choi, Hae-Sung Eom, Jeong-Won Cha, Hyunchul Cho, Laehyun Kim, Yo-Sub Han
2011 — conf
Analyzing category correlations for recommendation system.
ICUIMC
Bernhard Scholz, Sang-Min Choi, Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han