Various properties of various ultrafilters, various graph width parameters, and various connectivity systems (with survey)
T Fujita - arxiv preprint arxiv:2408.02299, 2024 - arxiv.org
This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …
[HTML][HTML] Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
F Wei-Kleiner - Journal of Computer and System Sciences, 2016 - Elsevier
We propose TEDI, an indexing for solving shortest path, and k Nearest Neighbors (kNN)
problems. TEDI is based on the tree decomposition methodology. The graph is first …
problems. TEDI is based on the tree decomposition methodology. The graph is first …
A Novel Index Method for K Nearest Object Query over Time‐Dependent Road Networks
K nearest neighbor (kNN) search is an important problem in location-based services (LBS)
and has been well studied on static road networks. However, in real world, road networks …
and has been well studied on static road networks. However, in real world, road networks …
Frequent pattern mining from dense graph streams
As technology advances, streams of data can be produced in many applications such as
social networks, sensor networks, bioinformatics, and chemical informatics. These kinds of …
social networks, sensor networks, bioinformatics, and chemical informatics. These kinds of …
Finding the k nearest objects over time dependent road networks
K nearest neighbor (k NN) search is an important problem and has been well studied on
static road networks. However, in real world, road networks are often time-dependent, ie, the …
static road networks. However, in real world, road networks are often time-dependent, ie, the …
Finding the shortest path with user requirements
CC Lu, ALP Chen - Proceedings of the 2017 International Conference …, 2017 - dl.acm.org
From the perspective of a user, finding the shortest path from a starting location to a
destination is only a basic requirement. Other demands may also be involved, such as …
destination is only a basic requirement. Other demands may also be involved, such as …
複数評価尺度に基づく道路網上での地理情報問合せ処理
佐藤秀樹， 中山泰宏 - 電気学会論文誌C (電子・情報・システム部門誌), 2018 - jstage.jst.go.jp
抄録 Geographical information query< D, F, ψ skyline> retrieves a subset from geographical
objects D under multi-criteria, each of which is an aggregate network distance in road …
objects D under multi-criteria, each of which is an aggregate network distance in road …