15 citations · 28 across the 4 of their papers we have counts for
4 papers
AA-ICP: Iterative Closest Point with Anderson Acceleration
A. L. Pavlov, G. V. Ovchinnikov, D. Yu. Derbyshev +2
Iterative Closest Point (ICP) is a widely used method for performing scan-matching and registration. Being simple and robust method, it is still computationally expensive and may b…
Art of singular vectors and universal adversarial perturbations
Valentin Khrulkov, Ivan Oseledets
Vulnerability of Deep Neural Networks (DNNs) to adversarial attacks has been attracting a lot of attention in recent studies. It has been shown that for many state of the art DNNs…
Linear complexity SimRank computation based on the iterative diagonal estimation
I. V. Oseledets, G. V. Ovchinnikov, A. M. Katrutsa
This paper presents a deterministic linear time complexity IDE-SimRank method to approximately compute SimRank with proved error bound. SimRank is a well-known similarity measure b…
Tensor SimRank for Heterogeneous Information Networks
Ben Usman, Ivan Oseledets
We propose a generalization of SimRank similarity measure for heterogeneous information networks. Given the information network, the intraclass similarity score s(a, b) is high if…