All Stories

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