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

k-nearest neighbor graph

biblio

Visible to the public Indexing in k-Nearest Neighbor Graph by Hash-Based Hill-Climbing

Submitted by grigby1 on Fri, 05/22/2020 - 2:25pm
  • file organisation
  • nearest neighbor search
  • vector quantization
  • Upper bound
  • SIFT1M datasets
  • query assignment process
  • nearest neighbor graph
  • k-nearest neighbor graph
  • Inverted index
  • indexing
  • hill-climbing
  • hashing-based seed generation
  • hashing
  • hash-based hill-climbing
  • GIST1M datasets
  • pubcrawl
  • Euclidean distance
  • Binary codes
  • approximation theory
  • approximate nearest neighbor search
  • query processing
  • Clustering algorithms
  • principal component analysis
  • graph theory
  • Acceleration
  • search problems
  • nearest neighbour methods
  • Measurement
  • Metrics
  • Indexes

Terms of Use  |  ©2023. CPS-VO