154 citations · 861 across the 94 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
stat.ML2011★ 53 cited
Finding Dense Clusters via "Low Rank + Sparse" Decomposition
Samet Oymak, Babak Hassibi
Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature \cite{Schaeffer}. It has various applications in pattern recog…
math.OC2011
A Simplified Approach to Recovery Conditions for Low Rank Matrices
Samet Oymak, Karthik Mohan, Maryam Fazel +1
Recovering sparse vectors and low-rank matrices from noisy linear measurements has been the focus of much recent research. Various reconstruction algorithms have been studied, incl…
cs.IT2011★ 2 cited
Subspace Expanders and Matrix Rank Minimization
Amin Khajehnejad, Samet Oymak, Babak Hassibi
Matrix rank minimization (RM) problems recently gained extensive attention due to numerous applications in machine learning, system identification and graphical models. In RM probl…