Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Wing-Kai Hon"'
Publikováno v:
IEEE Access, Vol 5, Pp 26340-26353 (2017)
Mobile users' service satisfaction plays a vital role in improving the revenue of telecom companies. When user data demands are uniform, satisfying the user requests is much easier than when demands are diverse. Yet, in a multicast scenario, each use
Externí odkaz:
https://doaj.org/article/49776544973c4c78b883df973a180db7
Publikováno v:
International Journal of Computational Geometry & Applications. 33:43-54
Orthogonal range search is ubiquitous nowadays, with natural applications in databases, data mining, and text indexing. Very recently, yet another application was discovered, which is to maintain a DFS forest in a dynamic graph. In this paper, we wan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe8f80af941d21bb4a081b8188977b0c
https://doi.org/10.1142/s0218195922410047
https://doi.org/10.1142/s0218195922410047
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57c700c88a44746e6bc6f745209f38bc
https://doi.org/10.1007/s00453-023-01105-3
https://doi.org/10.1007/s00453-023-01105-3
Publikováno v:
Algorithmica. 84:124-149
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a30c7ed2b5f5b759cd5ed8167219a6ef
https://doi.org/10.1007/s00453-021-00886-9
https://doi.org/10.1007/s00453-021-00886-9
Autor:
WING-KAI HON1 wkhon@cs.nthu.edu.tw, SHAH, RAHUL2 rahul@csc.lsu.edu, THANKACHAN, SHARMA V.2 thanks@csc.lsu.edu, SCOTT VITTER, JEFFREY3 jsv@ku.edu
Publikováno v:
Journal of the ACM. Apr2014, Vol. 61 Issue 2, p9-36. 36p.
Publikováno v:
International Journal of Computational Geometry & Applications. 33:1-2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a0d44e28cc7f75e6fe7eb963ee06364
https://doi.org/10.1142/s0218195923020016
https://doi.org/10.1142/s0218195923020016
Publikováno v:
Theoretical Computer Science. 854:52-62
Let P be a collection of d patterns { P 1 , P 2 , … , P d } of total length n characters, which are chosen from an alphabet Σ of size σ. Given a text T (over Σ), the dictionary indexing problem is to create a data structure using which we can re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61f2dd0a2e3b1077d787076140fd19c7
https://doi.org/10.1016/j.tcs.2020.11.036
https://doi.org/10.1016/j.tcs.2020.11.036
Autor:
Wing-Kai Hon, Kotaro Matsuda, Sharma V. Thankachan, Paniz Abedin, Yakov Nekrich, Rahul Shah, Arnab Ganguly, Kunihiko Sadakane
Publikováno v:
Theoretical Computer Science. 822:15-22
Let T [ 1 , n ] be a text of length n and T [ i , n ] be the suffix starting at position i. Also, for any two strings X and Y, let LCP ( X , Y ) denote their longest common prefix. The range-LCP of T w.r.t. a range [ α , β ] , where 1 ≤ α β ≤
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d362fd5e30f5505903afc3a183186658
https://doi.org/10.1016/j.tcs.2020.04.009
https://doi.org/10.1016/j.tcs.2020.04.009
Publikováno v:
Theoretical Computer Science. 814:210-222
Top-k query processing is an important building block for ranked retrieval, with various applications. In this paper, we consider two interesting top-k retrieval problems. In the first problem, we consider the r-combinations of a set S of n real numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92d7257d01655ccea5e74705f8395c74
https://doi.org/10.1016/j.tcs.2020.01.036
https://doi.org/10.1016/j.tcs.2020.01.036
Publikováno v:
2022 Data Compression Conference (DCC).
The run-length compressed Burrows-Wheeler transform (RLBWT) used in conjunction with the backward search introduced in the FM index is the centerpiece of most compressed indexes working on highly-repetitive data sets like biological sequences. Compar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::572810245512b683e5a0b34a9e495116
https://doi.org/10.1109/dcc52660.2022.00014
https://doi.org/10.1109/dcc52660.2022.00014