bacteria
发表于 2025-3-25 06:52:11
Capacity-Constrained Network-Voronoi Diagram: A Summary of Resultsce areas that meet service center capacities and minimize the sum of the distances (min-sum) from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications such as assigning evacuees to shelters and assigning patients to hospitals. This problem is NP-
Munificent
发表于 2025-3-25 09:37:36
http://reply.papertrans.cn/15/1499/149841/149841_22.png
Salivary-Gland
发表于 2025-3-25 14:42:36
http://reply.papertrans.cn/15/1499/149841/149841_23.png
臭名昭著
发表于 2025-3-25 19:54:24
Discovering Influential Data Objects over Timegnificant number of customers. However, customer preferences change over time, and product manufacturers are interested in monitoring the evolution of the popularity of their products, in order to discover those products that are consistently highly ranked. To take into account the temporal dimensio
aneurysm
发表于 2025-3-25 20:09:33
Finding Traffic-Aware Fastest Paths in Spatial Networksfinding traffic-aware fastest paths (TAFP query) in spatial networks by considering the related traffic conditions. Given a sequence of user specified intended places .. and a departure time ., TAFP finds the fastest path connecting .. in order to guarantee that moving objects (e.g., travelers and b
表示向下
发表于 2025-3-26 01:51:45
http://reply.papertrans.cn/15/1499/149841/149841_26.png
Muscularis
发表于 2025-3-26 07:46:15
http://reply.papertrans.cn/15/1499/149841/149841_27.png
和平
发表于 2025-3-26 11:46:32
PL-Tree: An Efficient Indexing Method for High-Dimensional Dataethod for a given set of data requires careful consideration of data properties, data construction methods, and query types. We present a new indexing method to support efficient point queries, range queries, and .-nearest neighbor queries. Our method indexes objects dynamically using algebraic tech
欲望
发表于 2025-3-26 15:41:52
http://reply.papertrans.cn/15/1499/149841/149841_29.png
Adornment
发表于 2025-3-26 20:21:46
Best Upgrade Plans for Large Road Networkswork (weighted graph) . where a subset of the edges are ., i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in ., and a budget (resource constraint) ., the BUP problem is to identify which upgrad