4 citations · 4 across the 3 of their papers we have counts for
4 papers
KScaNN: Scalable Approximate Nearest Neighbor Search on Kunpeng
Oleg Senkevich, Siyang Xu, Tianyi Jiang +13
Approximate Nearest Neighbor Search (ANNS) is a cornerstone algorithm for information retrieval, recommendation systems, and machine learning applications. While x86-based architec…
An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
Anna Mastikhina, Oleg Senkevich, Dmitry Sirotkin +2
This paper examines the graph partition problem and introduces a new metric, MSIDS (maximal sum of inner degrees squared). We establish its connection to the replication factor (RF…
Graph partition method based on finite projective planes
Oleg Kruglov, Anna Mastikhina, Oleg Senkevich +2
We present a novel graph partition algorithm with a theoretical bound for the replication factor of \sqrt(n), which improves known constrained approaches (grid: 2* \sqrt(n)-1, toru…
p-star models, mean field random networks and the heat hierarchy
Gino Biondini, Antonio Moro, Barbara Prinari +1
We consider the mean field analog of the p-star model for homogeneous random networks, and compare its behaviour with that of the p-star model and its classical mean field approxim…