Zobrazeno 1 - 10
of 611
pro vyhledávání: '"Kian Lee Tan"'
Publikováno v:
PeerJ, Vol 4, p e2695 (2016)
Background Human hair follicles are important for the renewal of new hairs and their development. The generation of induced pluripotent stem cells (iPSCs) from hair follicles is easy due to its accessibility and availability. The pluripotent cells de
Externí odkaz:
https://doaj.org/article/d170deb239784cd1a20850d029d3250c
Publikováno v:
Proceedings of the VLDB Endowment. 16:1249-1263
In this paper, we seek to perform a rigorous experimental study of main-memory hash joins in storage class memory (SCM). In particular, we perform a design space exploration in real SCM for two state-of-the-art join algorithms: partitioned hash join
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 34:431-445
Publikováno v:
The VLDB Journal. 32:887-904
Towards One-Size-Fits-Many: Multi-Context Attention Network for Diversity of Entity Resolution Tasks
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:6018-6032
Entity resolution (ER) identifies data instances referring to the same real-world entity and has received enormous research attention. In this paper, we examine the task of ER from a broader perspective, with its input extended from textual records,
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:4690-4704
In this paper, we study a new variant of trajectory similarity search from the context of continuous query processing. Given a moving object from s to $d$ , following a reference route $T_r$ , we monitor the trajectory similarity between the referenc
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:4231-4244
Subgraph enumeration is important for many applications such as network motif discovery, community detection, and frequent subgraph mining. To accelerate the execution, recent works utilize graphics processing units (GPUs) to parallelize subgraph enu
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:3714-3726
Publikováno v:
ACM SIGMOD Record. 51:51-58
The Kuhn-Munkres (KM) algorithm is a classical combinatorial optimization algorithm that is widely used for minimum cost bipartite matching in many real-world applications, such as transportation. For example, a ride-hailing service may use it to fin