Zobrazeno 1 - 10
of 2 004
pro vyhledávání: '"Kian Lee"'
Autor:
Ooi, Beng Chin, Cai, Shaofeng, Chen, Gang, Shen, Yanyan, Tan, Kian-Lee, Wu, Yuncheng, Xiao, Xiaokui, Xing, Naili, Yue, Cong, Zeng, Lingze, Zhang, Meihui, Zhao, Zhanhao
Publikováno v:
SCIENCE CHINA Information Sciences 67, 10 (2024)
In the wake of rapid advancements in artificial intelligence (AI), we stand on the brink of a transformative leap in data systems. The imminent fusion of AI and DB (AIxDB) promises a new generation of data systems, which will relieve the burden on en
Externí odkaz:
http://arxiv.org/abs/2405.03924
Co-movement pattern mining from GPS trajectories has been an intriguing subject in spatial-temporal data mining. In this paper, we extend this research line by migrating the data source from GPS sensors to surveillance cameras, and presenting the fir
Externí odkaz:
http://arxiv.org/abs/2308.05370
A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of vertices and a series of timestamped and directed edges. Temporal moti
Externí odkaz:
http://arxiv.org/abs/2211.12101
Autor:
Ooi, Beng Chin, Chen, Gang, Shou, Mike Zheng, Tan, Kian-Lee, Tung, Anthony, Xiao, Xiaokui, Yip, James Wei Luen, Zhang, Meihui
In the Metaverse, the physical space and the virtual space co-exist, and interact simultaneously. While the physical space is virtually enhanced with information, the virtual space is continuously refreshed with real-time, real-world information. To
Externí odkaz:
http://arxiv.org/abs/2206.10326
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in power-law graphs
Externí odkaz:
http://arxiv.org/abs/2012.09451
A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Tem
Externí odkaz:
http://arxiv.org/abs/2007.14028
Extracting a small subset of representative tuples from a large database is an important task in multi-criteria decision making. The regret-minimizing set (RMS) problem is recently proposed for representative discovery from databases. Specifically, f
Externí odkaz:
http://arxiv.org/abs/2007.09634
Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The $k$-regret minimizing set ($k$-RMS) problem was recently proposed for represe
Externí odkaz:
http://arxiv.org/abs/2005.14493