All Stories

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