Wing-Kai Hon

National Tsing Hua University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Rahul Shah

Louisiana State University

Sharma V. Thankachan

North Carolina State University

Jeffrey Scott Vitter

Tulane University

Tak‐Wah Lam

University of Hong Kong

Hsiang-Hsuan Liu

Utrecht University

Kunihiko Sadakane

The University of Tokyo

Ton Kloks

National Tsing Hua University

Wing‐Kin Sung

Genome Institute of Singapore

Siu‐Ming Yiu

University of Hong Kong

Yue-Li Wang

Beijing Anzhen Hospital

Cooperative Institutions

National Tsing Hua University

University of Hong Kong

Chinese University of Hong Kong

Purdue University West Lafayette

Hong Kong University of Science and Technology

National Yang Ming Chiao Tung University

National Taiwan University

National University of Singapore

Hong Kong Polytechnic University

Louisiana State University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Compressed Indexes for Approximate Library Management

Data Compression Conference (2010)

Wing-Kai Hon Winson Wu Ting-Shuo Yang

This paper investigates the approximate library management problem, which is to construct an index for a dynamic text collection $L$ such that for any query pattern $P$ and any integer $k$, we can report all $k$-error matches of $P$ in $L$ efficiently. Existing work either focussed on the static version of the problem or assumed k=0. We observe that by combining several recent techniques, we can achieve the first compressed indexes that support efficient pattern queries and updating simultaneously.

10.1109/dcc.2010.75

Cite

Citations (0)

Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees

Lecture notes in computer science (2013)

Hoa T. Vu Francis Y. L. Chin Wing-Kai Hon Henry Leung Kunihiko Sadakane

10.1007/978-3-642-38036-5_14

Cite

Citations (1)

General Max-Min Fair Allocation

Lecture notes in computer science (2021)

Sheng-Yen Ko Ho-Lin Chen Siu-Wing Cheng Wing-Kai Hon Chung-Shou Liao

10.1007/978-3-030-89543-3_6

Cite

Citations (0)

Reconstructing One-Articulated Networks with Distance Matrices

Lecture notes in computer science (2017)

Kuang-Yu Chang Yun Cui Siu‐Ming Yiu Wing-Kai Hon

Ultrametric space

Distance matrix

Tree (set theory)

Matrix (chemical analysis)

10.1007/978-3-319-59575-7_4

Cite

Citations (4)

Succinct Indexes for Circular Patterns

Lecture notes in computer science (2011)

Wing-Kai Hon Chen-Hua Lu Rahul Shah Sharma V. Thankachan

10.1007/978-3-642-25591-5_69

Cite

Citations (12)

Budget-constrained multi-battle contests: A new perspective and analysis

Theoretical Computer Science (2018)

Chu-Han Cheng Po‐An Chen Wing-Kai Hon

10.1016/j.tcs.2018.01.018

Cite

Citations (1)

Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment

IEEE Transactions on Mobile Computing (2008)

Yuhan Dong Wing-Kai Hon David K. Y. Yau Jren-Chit Chin

The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be exploited to greatly reduce the energy required by postponing communication until the sender moves close to a target receiver, subject to application deadline constraints. In this paper, we characterize the fundamental performance limit, namely the lower bound expected communication distance, achievable by any postponement algorithm within given deadline constraints. Our analytical results concern mainly the random waypoint (RWP) model. Specifically, we develop a tight analytical lower bound of the achievable expected communication distance under the model. In addition, we define a more general map-based movement model, and characterize its lower bound distance by simulations. We also address the practical attainment of distance reduction through movement-predicted communication. Specifically, whereas prior work has experimentally demonstrated the effectiveness a least distance (LD) algorithm, we provide an absolute performance measure of how closely LD can match the theoretical optimum. We show that LD achieves an average reduction in the expected communication distance within 62% to 94% of the optimal, over a realistic range of nodal speeds, for both the RWP and map-based models.

Mobility model

Waypoint

Communication source

10.1109/tmc.2008.113

Cite

Citations (10)

Non-shared edges and nearest neighbor interchanges revisited

Information Processing Letters (2004)

Wing-Kai Hon Ming‐Yang Kao Tak‐Wah Lam Wing‐Kin Sung Siu‐Ming Yiu

Nearest-neighbor chain algorithm

Nearest neighbor graph

Best bin first

10.1016/j.ipl.2004.04.003

Cite

Citations (7)

Hormones with adrenocorticotropic and opiate-like activities from the carp (cyprinus carpio) pituitary

Comparative Biochemistry and Physiology Part C Comparative Pharmacology (1986)

Wing-Kai Hon T.B. Ng

Opiate

ACTH receptor

10.1016/0742-8413(86)90223-9

Cite

Citations (8)

On Intelligent Mobile Target Detection in a Mobile Sensor Network

Jren-Chit Chin Yuhan Dong Wing-Kai Hon David K. Y. Yau

We study the problem of a mobile target (the mouse) trying to evade detection by one or more mobile sensors (we call such a sensor a cat) in a closed network area. We view our problem as a game between two players: the mouse, and the collection of cats forming a single (meta-)player. The game ends when the mouse falls within the sensing range of one or more cats. A cat tries to determine its optimal strategy to minimize the worst case expected detection time of the mouse. The mouse tries to determine an optimal counter movement strategy to maximize the expected detection time. We divide the problem into two cases based on the relative sensing capabilities of the cats and the mouse. When the mouse has a larger sensing range than the cats, we show how the mouse can determine its optimal movement strategy based on local observations of the cats' movements. When the mouse has a sensing range smaller than or equal to the cats', we develop a dynamic programming solution for the mouse's optimal strategy, assuming high level information about the cats' movement model. We discuss how the cats' chosen movement model will affect its presence matrix in the network, and hence its payoff in the game. Extensive experimental results verify and illustrate the analytical results, and evaluate the game's payoffs as a function of several important system parameters.

Stochastic game

10.1109/mobhoc.2007.4428608

Cite

Citations (13)