4 papers
How to Catch Grid Points
Sariel Har-Peled, Elfarouk Harb, Qizheng He
Given a positive integer , we study the problem of finding a convex polygon of minimum perimeter that encloses exactly points of . We show that an optimal poly…
Dense Subgraph Clustering and a New Cluster Ensemble Method
The-Anh Vu-Le, João Alfredo Cardoso Lamy, Tomás Alessi +5
We propose DSC-Flow-Iter, a new community detection algorithm that is based on iterative extraction of dense subgraphs. Although DSC-Flow-Iter leaves many nodes unclustered, it is…
Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
Elfarouk Harb, Yousef Yassin, Chandra Chekuri
We study the problem of minimizing or maximizing the average value of a submodular or supermodular set function over non-empty subsets $ S \s…
ReFill: Reinforcement Learning for Fill-In Minimization
Elfarouk Harb, Ho Shan Lam
Efficiently solving sparse linear systems , where is a large, sparse, symmetric positive semi-definite matrix, is a core challenge in scientific computing, machine learni…