A university project implementing Vamana-Indexing-Algorithm (VIA) for Approximate-Nearest-Neighbors (ANN) problem.
-
Updated
Dec 17, 2025 - C++
A university project implementing Vamana-Indexing-Algorithm (VIA) for Approximate-Nearest-Neighbors (ANN) problem.
Efficient k-NN Search With Graph-Based Indexing and Filter Constraints
A C++ implementation of the Vamana indexing algorithm for Approximate Nearest Neighbor search, exploring graph-based vector indexing techniques for fast similarity retrieval in high-dimensional spaces.
Vamana Indexing and Approximate Nearest Neighbor (ANN) Search Experimentation — Developed as part of the K23a Software Development for Information Systems Course at NKUA.
To associate your repository with the vamana-indexing-algorithm topic, visit your repo's landing page and select "manage topics."