From the 2 of 4 linked papers with an AI index.
6 citations · 8 across the 3 of their papers we have counts for
4 papers
Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets
Nico Hezel, Kai Uwe Barthel, Bruno Schilling +2
The paper proposes the Dynamic Exploration Graph (DEG), a graph‑based structure that supports fast approximate nearest neighbor search in multimedia datasets that change over time,…
An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval
Nico Hezel, Kai Uwe Barthel, Konstantin Schall +1
The paper introduces the continuous refining Exploration Graph (crEG), a graph‑based index that can be built quickly and uses little memory while delivering state‑of‑the‑art approx…
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…
Creating Sorted Grid Layouts with Gradient-based Optimization
Kai Uwe Barthel, Florian Tim Barthel, Peter Eisert +2
Visually sorted grid layouts provide an efficient method for organizing high-dimensional vectors in two-dimensional space by aligning spatial proximity with similarity relationship…