Search papers, labs, and topics across Lattice.
HTW Berlin, Berlin, Germany
3
7
4
10
The Dynamic Exploration Graph achieves superior efficiency in dynamic nearest neighbor searches, outperforming existing algorithms while maintaining static dataset performance.
Transforming the asymmetric inner product problem into a Euclidean search space could redefine efficiency benchmarks in high-dimensional embedding searches.
Efficient multimedia retrieval just got a boost with a new graph-based method that balances speed and precision, even for exploratory searches.
