2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IR2026
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…
cs.IR2026★ 2 cited
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…