6 citations · 15 across the 12 of their papers we have counts for
3 papers · 2 filters
Fast and Efficient Approximate Nearest Neighbor Search for High-Dimensional LLM Embeddings
Nico Hezel, Kai Uwe Barthel, Bruno Schilling +3
The annual SISAP Indexing Challenge benchmarks Approximate Nearest Neighbor Search (ANNS) algorithms under rigorous constraints. This paper presents our submissions for the 2026 ed…
Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets
Nico Hezel, Kai Uwe Barthel, Bruno Schilling +2
Approximate Nearest Neighbor Search (ANNS) represents a fundamental problem in various applications (image-search, recommendation systems). While graph-based algorithms have demons…
An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval
Nico Hezel, Kai Uwe Barthel, Konstantin Schall +1
As datasets and the dimensionality of feature vectors continue to grow, Approximate Nearest Neighbor Search (ANNS) in large multimedia databases becomes increasingly relevant. Grap…