Cover Image

Efficient Multiple Temporal Network Kernel Density Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shao, Yu, Cheng, Peng, Lian, Xiang, Chen, Lei, Ni, Wangze, Lin, Xuemin, Zhang, Chen, Wang, Liping
Format:	Preprint
Published:	2025
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

StructRide: A Framework to Exploit the Structure Information of Shareability Graph in Ridesharing
by: Zhan, Jiexi, et al.
Published: (2024)

Numerical Estimation of Spatial Distributions under Differential Privacy
by: Du, Leilei, et al.
Published: (2024)

Wait to be Faster: a Smart Pooling Framework for Dynamic Ridesharing
by: Zhong, Xiaoyao, et al.
Published: (2024)

ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models
by: Yan, Jianxin, et al.
Published: (2025)

RAC: Relation-Aware Cache Replacement for Large Language Models
by: Wu, Yuchong, et al.
Published: (2026)

Infinite Stream Estimation under Personalized $w$-Event Privacy
by: Du, Leilei, et al.
Published: (2025)

Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
by: Wang, Yiqi, et al.
Published: (2024)

GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query
by: Ge, Mingchang, et al.
Published: (2025)

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
by: Wu, Yanping, et al.
Published: (2024)

QCFuse: Query-Centric Cache Fusion for Efficient RAG Inference
by: Yan, Jianxin, et al.
Published: (2026)

Personalized w-Event Privacy for Infinite Stream Estimation
by: Du, Leilei, et al.
Published: (2026)

Efficient Dynamic Attributed Graph Generation
by: Li, Fan, et al.
Published: (2024)

Accelerating Historical K-Core Search in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025)

SINDI: an Efficient Index for Approximate Maximum Inner Product Search on Sparse Vectors
by: Li, Ruoxuan, et al.
Published: (2025)

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
by: Yu, Yuanhang, et al.
Published: (2026)

Accelerating K-Core Computation in Temporal Graphs
by: Ma, Zhuo, et al.
Published: (2025)

Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
by: He, Yizhang, et al.
Published: (2025)

Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
by: Ye, Yutong, et al.
Published: (2023)

Approximate Nearest Neighbor Search of Large Scale Vectors on Distributed Storage
by: Yu, Kun, et al.
Published: (2025)

Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2024)

Efficient Influence Minimization via Node Blocking
by: Wang, Jinghao, et al.
Published: (2024)

Efficient Temporal Simple Path Graph Generation
by: Tang, Zhiyang, et al.
Published: (2025)

Revisiting Graph Analytics Benchmark
by: Meng, Lingkai, et al.
Published: (2025)

Efficient Unsupervised Community Search with Pre-trained Graph Transformer
by: Wang, Jianwei, et al.
Published: (2024)

Towards Temporal Knowledge Graph Alignment in the Wild
by: Zhao, Runhao, et al.
Published: (2025)

FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search
by: Wu, Zekai, et al.
Published: (2026)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

Top-L Most Influential Community Detection Over Social Networks (Technical Report)
by: Zhang, Nan, et al.
Published: (2023)

Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
by: Ye, Yutong, et al.
Published: (2024)

C$^{2}$TC: A Training-Free Framework for Efficient Tabular Data Condensation
by: Xu, Sijia, et al.
Published: (2026)

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
by: Yuan, Long, et al.
Published: (2023)

Motif Counting in Complex Networks: A Comprehensive Survey
by: Yin, Haozhe, et al.
Published: (2025)

StreamTGN: A GPU-Efficient Serving System for Streaming Temporal Graph Neural Networks
by: Zhang, Lingling, et al.
Published: (2026)

S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2025)

Efficient k-step Weighted Reachability Query Processing Algorithms
by: Mei, Congquan, et al.
Published: (2024)

Reverse Influential Community Search Over Social Networks (Technical Report)
by: Wen, Qi, et al.
Published: (2024)

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
by: Mang, Qiuyang, et al.
Published: (2024)

S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
by: Wen, Qi, et al.
Published: (2026)

ODIN: Object Density Aware Index for CkNN Queries over Moving Objects on Road Networks
by: Yu, Ziqiang, et al.
Published: (2023)

Efficient Cloud-edge Collaborative Approaches to SPARQL Queries over Large RDF graphs
by: Ma, Shidan, et al.
Published: (2026)