Zobrazeno 1 - 10
of 158
pro vyhledávání: '"Zheng, Bolong"'
Autor:
Wang, Shaohua, Xie, Xing, Li, Yong, Guo, Danhuai, Cai, Zhi, Liu, Yu, Yue, Yang, Pan, Xiao, Lu, Feng, Wu, Huayi, Gui, Zhipeng, Ding, Zhiming, Zheng, Bolong, Zhang, Fuzheng, Wang, Jingyuan, Chen, Zhengchao, Lu, Hao, Li, Jiayi, Yue, Peng, Yu, Wenhao, Yao, Yao, Sun, Leilei, Zhang, Yong, Chen, Longbiao, Du, Xiaoping, Li, Xiang, Zhang, Xueying, Qin, Kun, Gong, Zhaoya, Dong, Weihua, Meng, Xiaofeng
This report focuses on spatial data intelligent large models, delving into the principles, methods, and cutting-edge applications of these models. It provides an in-depth discussion on the definition, development history, current status, and trends o
Externí odkaz:
http://arxiv.org/abs/2405.19730
Fine-tuning all parameters of Large Language Models (LLMs) is computationally expensive. Parameter-Efficient Fine-Tuning (PEFT) methods address this by selectively fine-tuning specific parameters. Most of the parameter efficient fine-tuning (PEFT) me
Externí odkaz:
http://arxiv.org/abs/2403.08484
With an exponentially growing number of graphs from disparate repositories, there is a strong need to analyze a graph database containing an extensive collection of small- or medium-sized data graphs (e.g., chemical compounds). Although subgraph enum
Externí odkaz:
http://arxiv.org/abs/2212.07612
Publikováno v:
In Information Sciences June 2024 670
Autor:
Zheng, Bolong, Zhao, Xi, Weng, Lianggui, Hung, Nguyen Quoc Viet, Liu, Hang, Jensen, Christian S.
Nearest neighbor (NN) search is inherently computationally expensive in high-dimensional spaces due to the curse of dimensionality. As a well-known solution, locality-sensitive hashing (LSH) is able to answer c-approximate NN (c-ANN) queries in subli
Externí odkaz:
http://arxiv.org/abs/2107.05537
Autor:
Pandey, Santosh, Wang, Zhibin, Zhong, Sheng, Tian, Chen, Zheng, Bolong, Li, Xiaoye, Li, Lingda, Hoisie, Adolfy, Ding, Caiwen, Li, Dong, Liu, Hang
Triangle counting is a building block for a wide range of graph applications. Traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle counting beats vertex-centric design, and iii) communication-fr
Externí odkaz:
http://arxiv.org/abs/2103.08053
Trajectory similarity computation is a fundamental component in a variety of real-world applications, such as ridesharing, road planning, and transportation optimization. Recent advances in mobile devices have enabled an unprecedented increase in the
Externí odkaz:
http://arxiv.org/abs/2101.08929
We consider a setting with an evolving set of requests for transportation from an origin to a destination before a deadline and a set of agents capable of servicing the requests. In this setting, an assignment authority is to assign agents to request
Externí odkaz:
http://arxiv.org/abs/2009.12157
Publikováno v:
In Applied Mathematics and Computation 1 December 2023 458
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.