All Stories

  1. SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search
  2. A New Sparse Data Clustering Method Based On Frequent Items
  3. A Stitch in Time Saves Nine: Enabling Early Anomaly Detection with Correlation Analysis
  4. Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search
  5. DIOT: Detecting Implicit Obstacles from Trajectories
  6. Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere
  7. Unsupervised Abstract Reasoning for Raven’s Problem Matrices
  8. A Novel LSH Scheme for Similarity Search
  9. An Accurate and Fast Method for Maximum Inner Product Search
  10. An Efficient Method for Furthest Neighbor Search
  11. Query-Aware Locality-Sensitive Hashing for l_p Norm
  12. An Efficient LSH Scheme for Furthest Neighbor Search
  13. A New Method for Module Identification with Application to Cancer Disease Module Discovery
  14. A Novel Method for Similarity Search in High-Dimensional Spaces
  15. Community Detection Using Cooperative Co-evolutionary Differential Evolution