78 citations · 292 across the 15 of their papers we have counts for
5 papers · 1 filter
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…
Peer Effects and Stability in Matching Markets
Elizabeth Bodine-Baron, Christina Lee, Anthony Chong +2
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college stud…
Reweighted LP Decoding for LDPC Codes
Amin Khajehnejad, Alexandros G. Dimakis, Babak Hassibi +2
We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step…
Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing
M. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar +1
We introduce a new class of measurement matrices for compressed sensing, using low order summaries over binary sequences of a given length. We prove recovery guarantees for three r…
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…