Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Myunghoon Kang

dblp:183/4671 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Question answering and dialogue systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems › table question answering
multi-table question answering
1.012026
EASE: Entity-Aware Sub-table Generation for Real-world Multi-table QA · ACL (1) 2026
Natural language and speech › Question answering and dialogue systems
table question answering
1.012026
EASE: Entity-Aware Sub-table Generation for Real-world Multi-table QA · ACL (1) 2026

Methods — techniques the papers use, named apart from their topics

entity-aware sub-table generation · 1.0
YearPublicationVenuePosition
2026 EASE: Entity-Aware Sub-table Generation for Real-world Multi-table QA
abstract
Myunghoon Kang, Dahyun Jung, Suhyune Son, Seonmin Koo, Changwoo Chun, Daniel Rim, Haeyoung Kwon, Yuna Hur, Heuiseok Lim. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Myunghoon Kang, Dahyun Jung, Suhyune Son, Seonmin Koo, Changwoo Chun, Daniel Rim, Haeyoung Kwon, Yuna Hur, Heuiseok Lim
ACL (1)1
2016 Iterative Localization of Network Nodes Using Absence of Distance Measurement Information
abstract
This paper considers the wireless sensor network iterative localization problem, which involves determining the 2D or 3D position of all nodes in a sequential manner. By utilizing information about the absence of distance measurements as well as all available distance measurements, it is possible to localize a significantly larger number of nodes than previous methods. When considering possible candidate locations for a node, the proposed method utilizes the fact that certain candidates are impossible because those candidates would require distance measurements that are absent (missing). A pseudocode solution is proposed, and simulation results are used to demonstrate the level of localizability achievable with this type of scheme.
Sunggu Lee, Myunghoon Kang
ISORC2