4 papers
Efficient Distributed Algorithms for the -Nearest Neighbors Problem
Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
The -nearest neighbors is a basic problem in machine learning with numerous applications. In this problem, given a (training) set of data points with labels and a query poin…
Efficient Distributed Community Detection in the Stochastic Block Model
Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Designing effective algorithms for community detection is an important and challenging problem in {\em large-scale} graphs, studied extensively in the literature. Various solutions…
Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs
Soumyottam Chatterjee, Reza Fathi, Gopal Pandurangan +1
We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G…
Anomaly Detection in XML-Structured SOAP Messages Using Tree-Based Association Rule Mining
Reyhaneh Ghassem Esfahani, Mohammad Abadollahi Azgomi, Reza Fathi
Web services are software systems designed for supporting interoperable dynamic cross-enterprise interactions. The result of attacks to Web services can be catastrophic and causing…