• # BLOOMP

• Referenced in 28 articles [sw06454]
• grid spacing is below the Rayleigh threshold. Algorithms based on techniques of band exclusion ... pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis pursuit (BP), and Lasso ... comparisons with the algorithms spectral iterative hard thresholding and the frame-adapted BP demonstrate...
• # azove

• Referenced in 13 articles [sw04634]
• parallel AND operation on threshold BDDs. In particular our algorithm is capable of solving knapsack ... optimal variable ordering is an NP-hard problem. We derive a $0/1$ IP for finding ... optimal variable ordering of a threshold BDD. This $0/1$ IP formulation provides the basis...
• # SE-Sync

• Referenced in 12 articles [sw40678]
• nonconvex maximum-likelihood estimation that is computationally hard to solve in general. Nevertheless, in this ... available measurements falls below a certain critical threshold; furthermore, whenever exactness obtains, it is possible...
• # TFRP

• Referenced in 3 articles [sw37089]
• where k is a pre-defined security threshold. For a certain k, an optimal multivariable ... minimum information loss is an NP-hard problem. Existing fixed-size techniques can obtain...