脱落
发表于 2025-3-25 05:21:11
http://reply.papertrans.cn/55/5417/541646/541646_21.png
dendrites
发表于 2025-3-25 09:32:06
Propagating Maximum Capacities for Recommendationnappropriately poor performance. As a remedy, we propose to propagate information (e.g., similarities) across the item graph to leverage sparse data. Instead of processing only directly connected items (e.g. co-occurrences), the similarity of two items is defined as the maximum capacity path interco
寡头政治
发表于 2025-3-25 15:02:24
http://reply.papertrans.cn/55/5417/541646/541646_23.png
Monocle
发表于 2025-3-25 16:25:31
http://reply.papertrans.cn/55/5417/541646/541646_24.png
Enzyme
发表于 2025-3-25 20:05:40
http://reply.papertrans.cn/55/5417/541646/541646_25.png
BOOR
发表于 2025-3-26 02:54:19
Real-Time Public Transport Delay Prediction for Situation-Aware Routingof real-time data and its predictions in the trip planning process. We present a system for individual multi-modal trip planning that incorporates predictions of future public transport delays in routing. Future delay times are computed by a Spatio-Temporal-Random-Field based on a stream of current
MILL
发表于 2025-3-26 06:22:49
A Generalization of Probabilistic Argumentation with Dempster-Shafer Theoryymemes. In this paper, using legal argument from analogy, we argue that in this reconstruction process interpreters may have to deal with a kind of uncertainty that can be appropriately represented in Dempster-Shafer (DS) theory rather than classical probability theory. Hence we generalize and relax
护身符
发表于 2025-3-26 09:22:55
http://reply.papertrans.cn/55/5417/541646/541646_28.png
丛林
发表于 2025-3-26 15:20:01
An Experimental Study of Dimensionality Reduction Methodsance of DR techniques for data analysis and visualization led to the development of a large diversity of DR methods. The lack of comprehensive comparative studies makes it difficult to choose the best DR methods for a particular task based on known strengths and weaknesses. To close the gap, this pa
Interregnum
发表于 2025-3-26 17:59:23
Planning with Independent Task Networksms that can be operationalized using classical graph search techniques such as A*. For two reasons, however, this strategy is sometimes inefficient. First, identical tasks might be resolved several times within the search process, i.e., the same subproblem is solved repeatedly instead of being reuse