ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2010.04948
  4. Cited By
Making Online Sketching Hashing Even Faster

Making Online Sketching Hashing Even Faster

10 October 2020
Xixian Chen
Haiqin Yang
Shenglin Zhao
Michael R. Lyu
Irwin King
ArXiv (abs)PDFHTML

Papers citing "Making Online Sketching Hashing Even Faster"

3 / 3 papers shown
Title
Locality Sensitive Hash Aggregated Nonlinear Neighbourhood Matrix
  Factorization for Online Sparse Big Data Analysis
Locality Sensitive Hash Aggregated Nonlinear Neighbourhood Matrix Factorization for Online Sparse Big Data Analysis
Zixuan Li
Hao Li
KenLi Li
Fan Wu
L. Chen
Keqin Li
148
0
0
23 Nov 2021
An Improved Frequent Directions Algorithm for Low-Rank Approximation via
  Block Krylov Iteration
An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration
Chenhao Wang
Qianxin Yi
Xiuwu Liao
Yao Wang
60
2
0
24 Sep 2021
Online Enhanced Semantic Hashing: Towards Effective and Efficient
  Retrieval for Streaming Multi-Modal Data
Online Enhanced Semantic Hashing: Towards Effective and Efficient Retrieval for Streaming Multi-Modal Data
Xiao-Ming Wu
Xin Luo
Yu-Wei Zhan
Chen-Lu Ding
Zhen-Duo Chen
Xin-Shun Xu
40
11
0
09 Sep 2021
1