Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Ge-Ming Chiu"'
Publikováno v:
IEEE Transactions on Network and Service Management. 18:3021-3036
Network Function Virtualization (NFV) pushes the hardware-based network functions to generic servers as software and brings a highly flexible for deployment. The availability of Virtual Machines (VMs) enables the dynamic placement of Virtual Network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0345915838d21f7cd7bedb4a09fb0da9
https://doi.org/10.1109/tnsm.2021.3086977
https://doi.org/10.1109/tnsm.2021.3086977
Publikováno v:
Pervasive and Mobile Computing. 42:93-107
Recent years have witnessed the generation of a massive amount of spatialtextual data. In view of this, a new type of query coined spatial keyword query has been proposed to deal with the location-based services with additional keyword constraint. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1dd5342a88b514ea3676619b0eae9cf
https://doi.org/10.1016/j.pmcj.2017.09.009
https://doi.org/10.1016/j.pmcj.2017.09.009
Autor:
Ge-Ming Chiu, Kai-Ting Yang
Publikováno v:
Pervasive and Mobile Computing. 39:231-248
This paper investigates the continuous all k -nearest neighbor (CAkNN) problem in a pervasive and mobile computing environment, which is a spatial query that continuously monitors kNN results for all mobile users in the network for a specified period
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27311ad32aee1e2040ca00b6dd180d64
https://doi.org/10.1016/j.pmcj.2016.07.002
https://doi.org/10.1016/j.pmcj.2016.07.002
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 28:850-862
Group services are highly important for a variety of computing application domains. In this paper, we study the fundamental problem of allocating a set of service patrons to a set of service groups in an attempt to maximize the total profit gained by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6001d2591d11953d8d5bae1b03b68ca9
https://doi.org/10.1109/tpds.2016.2597840
https://doi.org/10.1109/tpds.2016.2597840
Close Dominance Graph: An Efficient Framework for Answering Continuous Top- \(k\) Dominating Queries
Autor:
Bagus Jati Santoso, Ge-Ming Chiu
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 26:1853-1865
There are two preference-based queries commonly used in database systems: (1) top-k query and (2) skyline query. By combining the ranking rule used in top-k query and the notion of dominance relationships utilized in the skyline query, a top-k domina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9678c3b423b2de9a43bb2c997e63c1d
https://doi.org/10.1109/tkde.2013.172
https://doi.org/10.1109/tkde.2013.172
Publikováno v:
Computer Networks. 57:2856-2868
During recent years, the Internet has witnessed rapid advancement in peer-to-peer (P2P) media streaming. In these applications, an important issue has been the block scheduling problem, which deals with how each node requests the media data blocks fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::101ed6c5b6af682ce1f32c849ac8b09b
https://doi.org/10.1016/j.comnet.2013.06.014
https://doi.org/10.1016/j.comnet.2013.06.014
Publikováno v:
IEEE Transactions on Computers. 60:1431-1444
This work considers data query applications in tree-structured networks, where a given set of source nodes generate (or collect) data and forward the data to some halfway storage nodes for satisfying queries that call for data generated by all source
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b43a6a08a53a65d532184e4c86ef82b
https://doi.org/10.1109/tc.2010.231
https://doi.org/10.1109/tc.2010.231
Autor:
Ge-Ming Chiu, Kai-Ting Yang
Publikováno v:
The Computer Journal. 54:2017-2032
Cache sharing has been a popular technique used to facilitate data access in mobile network environments. The key to this technique is to allow an efficient sharing of cache contents between neighboring nodes without introducing excessive amount of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd8fcba7c00d9bbdb369f4682879c8d5
https://doi.org/10.1093/comjnl/bxr079
https://doi.org/10.1093/comjnl/bxr079
Autor:
Jane-Ferng Chiu, Ge-Ming Chiu
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 8:481-493
Diskless checkpointing is an important technique for performing fault tolerance in distributed or parallel computing systems. This study proposes a new approach to enhance neighbor-based diskless checkpointing to tolerate multiple failures using simp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d56e2de18ecdbfcff7ca6da01dbb261
https://doi.org/10.1109/tdsc.2010.76
https://doi.org/10.1109/tdsc.2010.76
Publikováno v:
Telecommunication Systems. 41:121-140
In this paper, we propose a new mobicast routing protocol, called the HVE-mobicast (hierarchical-variant-egg-based mobicast) routing protocol, in wireless sensor networks (WSNs). Existing protocols for a spatiotemporal variant of the multicast protoc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33e0b0e329368c6f053eba8a48f8a766
https://doi.org/10.1007/s11235-009-9154-0
https://doi.org/10.1007/s11235-009-9154-0