Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

codes data

biblio

Visible to the public Stacked K-Means Hashing Quantization for Nearest Neighbor Search

Submitted by grigby1 on Fri, 05/22/2020 - 2:38pm
  • hypercube increases
  • target data
  • stacked k-means hashing quantization
  • SKMH
  • similar approximation ability
  • optimizing time
  • multilayer lower-dimensional cubes
  • mentioned optimizing process
  • KMH method
  • KMH divides
  • K-means Hashing
  • k-means
  • information available online
  • improved hashing method
  • pubcrawl
  • higher-dimensional cubes
  • High-dimensional Vectors
  • fast nearest neighbor search
  • codes data
  • binary code optimizing
  • high dimensional data
  • low-dimensional subspaces
  • nearest neighbor search
  • search problems
  • Measurement
  • optimisation
  • Metrics

Terms of Use  |  ©2023. CPS-VO