All Stories

  1. STORM: Spatio-Temporal Similar Trajectory Retrieval on Non-Uniform Maritime Data
  2. TempASD: Temporal Anomalous Subgraph Discovery in Large-Scale Dynamic Financial Networks
  3. UnG-MoCha: Neural Motif Counting in Uncertain Graphs
  4. MoDiff - Graph Generation with Motif-aware Diffusion Model
  5. UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge
  6. SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search
  7. Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
  8. Similarity and Diversity: PCA-Based Contribution Evaluation in Federated Learning
  9. ReadGraph: Relational Evolution Enhanced Anomaly Detection in Dynamic Heterogeneous Graph
  10. CSPO: Cross-Market Synergistic Stock Price Movement Forecasting with Pseudo-volatility Optimization
  11. TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
  12. Hypergraph-Enhanced Multi-Granularity Stochastic Weight Completion in Sparse Road Networks
  13. Reproducibility Report for ACM SIGMOD 2024 Paper: 'Temporal JSON Keyword Search'
  14. Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing
  15. Machine learning model improves job mobility predictions by studying market connections
  16. Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
  17. On Efficient Large Sparse Matrix Chain Multiplication
  18. A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery
  19. A Similarity-based Approach for Efficient Large Quasi-clique Detection
  20. Efficient and effective algorithms for densest subgraph discovery and maintenance
  21. Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
  22. Accelerating directed densest subgraph queries with software and hardware approaches
  23. Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery
  24. On Querying Connected Components in Large Temporal Graphs
  25. Scalable Algorithms for Densest Subgraph Discovery
  26. Fdm: Effective and Efficient Incident Detection on Sparse Trajectory Data
  27. Densest subgraph discovery on large graphs
  28. Towards Passive, Migration-Free, Standardized, Long-Term Database Archival
  29. Effective community search over large star-schema heterogeneous information networks
  30. Finding locally densest subgraphs
  31. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery
  32. DeepTEA
  33. On Directed Densest Subgraph Discovery
  34. Efficient Directed Densest Subgraph Discovery
  35. On analyzing graphs with motif-paths
  36. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs
  37. LINC