Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Sheung-Hung Poon"'
Publikováno v:
Algorithms, Vol 11, Iss 10, p 156 (2018)
Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem. The requests
Externí odkaz:
https://doaj.org/article/80afb1e6cb6d4c1da2651c78ed904fd6
Publikováno v:
PLoS ONE, Vol 10, Iss 9, p e0136264 (2015)
The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, Vh}, where each Vi is maximized, such that for any two vertices
Externí odkaz:
https://doaj.org/article/1835cb1ca3cd4b28865a9c844ff0f6af
Autor:
Sheung-Hung Poon, Jiachen Yu
Publikováno v:
2022 26th International Conference Information Visualisation (IV).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8588178c55d5194e1cae4a8461622f40
https://doi.org/10.1109/iv56949.2022.00014
https://doi.org/10.1109/iv56949.2022.00014
Publikováno v:
Theoretical Computer Science. 821:15-22
Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must assign some amount of bundles to each buyer with respect to the buyer's acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86a3af81f1952024540851c66652bfeb
https://doi.org/10.1016/j.tcs.2020.03.017
https://doi.org/10.1016/j.tcs.2020.03.017
Autor:
Yuanliang Gao, Sheung-Hung Poon
Publikováno v:
CEC
In many applications, the logic of the program can be described using a task graph, where the data dependencies and execution time of each task are described. These dependencies create precedence constraints among tasks, which are requirements that s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::634d0035e22737b43b3a394f4b7d4eed
https://doi.org/10.1109/cec45853.2021.9504867
https://doi.org/10.1109/cec45853.2021.9504867
Publikováno v:
Theoretical Computer Science. 640:84-93
We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04667a2a6946cc4e5c3fed543ff3da1f
https://doi.org/10.1016/j.tcs.2016.06.006
https://doi.org/10.1016/j.tcs.2016.06.006
Publikováno v:
Computational Geometry. 51:15-24
This paper is concerned with the crossing number of Euclidean minimum-weight Laman graphs in the plane. We first investigate the relation between the Euclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34dddacadcd7baaf12c73effaa494457
https://doi.org/10.1016/j.comgeo.2015.10.002
https://doi.org/10.1016/j.comgeo.2015.10.002
Publikováno v:
Computer Aided Geometric Design. 81:101892
Geographical visualization systems, such as online maps, provide interactive operations of continuous zooming and panning. With consistent dynamic map labeling, users can navigate continuously in the map areas such that labels are not allowed to exhi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5490fc9c0903c9a32eec4878221b5748
https://doi.org/10.1016/j.cagd.2020.101892
https://doi.org/10.1016/j.cagd.2020.101892
Publikováno v:
Algorithms
Volume 11
Issue 10
Algorithms, Vol 11, Iss 10, p 156 (2018)
Volume 11
Issue 10
Algorithms, Vol 11, Iss 10, p 156 (2018)
Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem. The requests
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a891784526627fdce1bda0b21642ad6
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783030046170
AAIM
AAIM
The problem of item selling with the objective of maximizing the revenue is studied. Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53a5ed87e82f0fe10da897ada3bddcef
https://doi.org/10.1007/978-3-030-04618-7_9
https://doi.org/10.1007/978-3-030-04618-7_9
