2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IT2012
Tight Sufficient Conditions on Exact Sparsity Pattern Recovery
Behrooz Kamary Aliabadi, Silèye Ba
A noisy underdetermined system of linear equations is considered in which a sparse vector (a vector with a few nonzero elements) is subject to measurement. The measurement matrix e…
cs.NE2012★ 2 cited
Learning sparse messages in networks of neural cliques
Behrooz Kamary Aliabadi, Claude Berrou, Vincent Gripon +1
An extension to a recently introduced binary neural network is proposed in order to allow the learning of sparse messages, in large numbers and with high memory efficiency. This ne…