activity
20132026
most citedReducibility and Computational Lower Bounds for Problems with Planted Sparse Structure

31 citations · 59 across the 37 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

cs.LG2019★ 6 cited

Same-Cluster Querying for Overlapping Clusters

Wasim Huleihel, Arya Mazumdar, Muriel Médard +1

Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given elements to be clustered into possibly overlapping clusters…

math.ST2019★ 10 cited

Universality of Computational Lower Bounds for Submatrix Detection

Matthew Brennan, Guy Bresler, Wasim Huleihel

In the general submatrix detection problem, the task is to detect the presence of a small submatrix with entries sampled from a distribution in an $n \ti…