All Stories

  1. TrajLM: Transferable Mobility Pattern Distillation for Unified Trajectory Learning in Sparse Road Networks
  2. Explainable Anomaly Detection in Dynamic Heterogeneous Graphs via Relation Evolution
  3. Hitcher: Efficient GPU-based Vector Search via Cluster-Centric Kernel and Hitch-Ride Ordering
  4. Mamba Hawkes Process for Event Sequence Modeling
  5. Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC
  6. Corrigendum: Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study: [Experiments & Analysis]
  7. Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
  8. Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study
  9. STORM: Spatio-Temporal Similar Trajectory Retrieval on Non-Uniform Maritime Data
  10. TempASD: Temporal Anomalous Subgraph Discovery in Large-Scale Dynamic Financial Networks
  11. UnG-MoCha: Neural Motif Counting in Uncertain Graphs
  12. MoDiff - Graph Generation with Motif-aware Diffusion Model
  13. UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge
  14. SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search
  15. Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
  16. Similarity and Diversity: PCA-Based Contribution Evaluation in Federated Learning
  17. Efficient Structural Clustering Over Hypergraphs
  18. ReadGraph: Relational Evolution Enhanced Anomaly Detection in Dynamic Heterogeneous Graph
  19. CSPO: Cross-Market Synergistic Stock Price Movement Forecasting with Pseudo-volatility Optimization
  20. TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
  21. Hypergraph-Enhanced Multi-Granularity Stochastic Weight Completion in Sparse Road Networks
  22. Reproducibility Report for ACM SIGMOD 2024 Paper: 'Temporal JSON Keyword Search'
  23. Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs
  24. Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-Aware Index
  25. Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing
  26. In-Depth Analysis of Densest Subgraph Discovery in a Unified Framework
  27. FDM: Effective and efficient incident detection on sparse trajectory data
  28. Machine learning model improves job mobility predictions by studying market connections
  29. Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
  30. Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks
  31. Distributed Shortest Distance Labeling on Large-Scale Graphs
  32. On Efficient Large Sparse Matrix Chain Multiplication
  33. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
  34. A Similarity-based Approach for Efficient Large Quasi-clique Detection
  35. Efficient Core Decomposition Over Large Heterogeneous Information Networks
  36. Efficient and effective algorithms for densest subgraph discovery and maintenance
  37. Influential Exemplar Replay for Incremental Learning in Recommender Systems
  38. Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
  39. Before Generation, Align it! A Novel and Effective Strategy for Mitigating Hallucinations in Text-to-SQL Generation
  40. TRoute: Dynamic Time-Dependent Route Recommendation on Road Networks
  41. MOSER: Scalable Network Motif Discovery Using Serial Test
  42. Accelerating directed densest subgraph queries with software and hardware approaches
  43. Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
  44. On Querying Connected Components in Large Temporal Graphs
  45. Scalable Algorithms for Densest Subgraph Discovery
  46. Fdm: Effective and Efficient Incident Detection on Sparse Trajectory Data
  47. Densest subgraph discovery on large graphs
  48. Towards Passive, Migration-Free, Standardized, Long-Term Database Archival
  49. Effective community search over large star-schema heterogeneous information networks
  50. Finding locally densest subgraphs
  51. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery
  52. DeepTEA
  53. On Directed Densest Subgraph Discovery
  54. Efficient Directed Densest Subgraph Discovery
  55. On analyzing graphs with motif-paths
  56. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
  57. LINC