4 papers
Quantum Complexity vs Classical Complexity: A Survey
Arash Vaezi, Ali Movaghar, Mohammad Ghodsi +3
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strateg…
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering
Sepideh Aghamolaei, Mohammad Ghodsi
Given a set of points labeled with labels, we introduce the heat map sorting problem as reordering and merging the points and dimensions while preserving the clusters (labels).…
A 2-Approximation Algorithm for Data-Distributed Metric k-Center
Sepideh Aghamolaei, Mohammad Ghodsi
In a metric space, a set of point sets of roughly the same size and an integer are given as the input and the goal of data-distributed -center is to find a subset of s…
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
Sepideh Aghamolaei, Mohammad Ghodsi
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved…