Mohammad Ghodsi | DeepAI

DeepAI AI Chat

Featured Co-authors

MohammadTaghi Hajiaghayi
47 publications
Anil Maheshwari
27 publications
Saeed Seddighin
19 publications
Ali Mohades
14 publications
Sepideh Aghamolaei
12 publications
Bodhayan Roy
12 publications
Vahideh Keikha
11 publications
Arash Vaezi
8 publications
Masoud Seddighin
7 publications
Ahmad Asgharian Rezaei
6 publications
Hamed Saleh
6 publications

∙ 09/14/2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering

Given a set of points labeled with k labels, we introduce the heat map s...

0 Sepideh Aghamolaei, et al. ∙

∙ 09/08/2023

A 2-Approximation Algorithm for Data-Distributed Metric k-Center

In a metric space, a set of point sets of roughly the same size and an i...

0 Sepideh Aghamolaei, et al. ∙

∙ 09/01/2023

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem

Sublinear time complexity is required by the massively parallel computat...

0 Sepideh Aghamolaei, et al. ∙

∙ 08/29/2023

An Efficient Construction of Yao-Graph in Data-Distributed Settings

A sparse graph that preserves an approximation of the shortest paths bet...

0 Sepideh Aghamolaei, et al. ∙

∙ 08/12/2023

A parallel algorithm for Delaunay triangulation of moving points on the plane

Delaunay Triangulation(DT) is one of the important geometric problems th...

0 Nazanin Hadiniya, et al. ∙

∙ 08/29/2022

Trajectory Range Visibility

Consider two entities with constant but not necessarily equal velocities...

0 Seyed Mohammad Hussein Kazemi, et al. ∙

∙ 12/02/2021

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery

Given a simple polygon P, in the Art Gallery problem the goal is to find...

0 Arash Vaezi, et al. ∙

∙ 11/29/2021

Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits

The classic cake-cutting problem provides a model for addressing the fai...

0 Mohammad Ghodsi, et al. ∙

∙ 11/27/2021

Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

The k-center problem is to choose a subset of size k from a set of n poi...

0 Vahideh Keikha, et al. ∙

∙ 08/24/2021

Art Gallery Plus Single Specular-reflection

Given a simple polygon P, in the Art Gallery problem, the goal is to fin...

0 Arash Vaezi, et al. ∙

∙ 12/08/2020

Computing The Packedness of Curves

A polygonal curve P with n vertices is c-packed, if the sum of the lengt...

0 Sepideh Aghamolaei, et al. ∙

∙ 11/05/2020

Visibility Extension via Reflection

This paper studies a variant of the Art-gallery problem in which "walls"...

0 Arash Vaezi, et al. ∙

∙ 09/25/2020

Parsisanj: a semi-automatic component-based approach towards search engine evaluation

Accessing to required data on the internet is wide via search engines in...

0 Amin Heydari Alashti, et al. ∙

∙ 07/22/2020

Point-Location in The Arrangement of Curves

An arrangement of n curves in the plane is given. The query is a point q...

0 Sepideh Aghamolaei, et al. ∙

∙ 05/14/2020

Approximating p-Mean Curve of Large Data-Sets

Given p, k and a set of polygonal curves P_1,…,P_L, the p-mean curve M o...

0 Sepideh Aghamolaei, et al. ∙

∙ 02/05/2019

A Composable Coreset for k-Center in Doubling Metrics

A set of points P in a metric space and a constant integer k are given. ...

0 Sepideh Aghamolaei, et al. ∙

∙ 12/24/2018

On the Distortion Value of the Elections with Abstention

In Spatial Voting Theory, distortion is a measure of how good the winner...

0 Mohammad Ghodsi, et al. ∙

∙ 11/19/2018

Visibility Extension via Reflective Edges to an Exact Quantity

We consider extending the visibility polygon of a given point q, inside ...

0 Arash Vaezi, et al. ∙

∙ 05/16/2018

Fair Allocation of Indivisible Items With Externalities

One of the important yet insufficiently studied subjects in fair allocat...

0 Mohammad Ghodsi, et al. ∙

∙ 04/11/2018

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

The edit distance between two strings is defined as the smallest number ...

0 Mahdi Boroujeni, et al. ∙

∙ 07/29/2017

Expanding Visibility Polygons by Mirrors upto at least K units

We consider extending visibility polygon (VP) of a given point q (VP(q))...

0 Arash Vaezi, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world