Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
A multiresolution technique for biomedical image interpolation is presented in this paper. It is an extension of the work on Directional Coherence Interpolation (DCI) [15] ? a nov...
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...