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

Vantage Point Tree

biblio

Visible to the public Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data

Submitted by aekwall on Mon, 02/22/2021 - 1:45pm
  • load balancing
  • Load management
  • high-dimensional data
  • graph-based sequential approximate k-NN search algorithm
  • hierarchical navigable small world
  • HNSW
  • k-d tree-based solution
  • k-nearest neighbor search
  • K-NN search
  • nearest neighbor search
  • MPI one-sided communication
  • MPI-OpenMP solution
  • Nearest neighbor methods
  • parallel algorithms
  • similarity search
  • Vantage Point Tree
  • vantage point trees
  • Measurement
  • learning (artificial intelligence)
  • machine learning
  • pubcrawl
  • graph theory
  • Big Data
  • query processing
  • trees (mathematics)
  • Data mining
  • machine learning algorithms
  • application program interfaces
  • Predictive Metrics
  • Partitioning algorithms
  • approximation theory
  • Approximation algorithms
  • message passing
  • search problems

Terms of Use  |  ©2023. CPS-VO