2 citations · 2 across the 7 of their papers we have counts for
7 papers
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…
An Efficient Construction of Yao-Graph in Data-Distributed Settings
Sepideh Aghamolaei, Mohammad Ghodsi
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we d…
A parallel algorithm for Delaunay triangulation of moving points on the plane
Nazanin Hadiniya, Mohammad Ghodsi
Delaunay Triangulation(DT) is one of the important geometric problems that is used in various branches of knowledge such as computer vision, terrain modeling, spatial clustering an…
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery
Arash Vaezi, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can s…