17 citations · 38 across the 5 of their papers we have counts for
5 papers
MCMC with Strings and Branes: The Suburban Algorithm
Jonathan J. Heckman, Jeffrey G. Bernstein, Ben Vigoda
Motivated by the physics of strings and branes, we introduce a general suite of Markov chain Monte Carlo (MCMC) "suburban samplers" (i.e., spread out Metropolis). The suburban algo…
MCMC with Strings and Branes: The Suburban Algorithm (Extended Version)
Jonathan J. Heckman, Jeffrey G. Bernstein, Ben Vigoda
Motivated by the physics of strings and branes, we develop a class of Markov chain Monte Carlo (MCMC) algorithms involving extended objects. Starting from a collection of parallel…
Compressive sensing for dynamic spectrum access networks: Techniques and tradeoffs
J. N. Laska, W. F. Bradley, T. W. Rondeau +2
We explore the practical costs and benefits of CS for dynamic spectrum access (DSA) networks. Firstly, we review several fast and practical techniques for energy detection without…
Accelerating Inference: towards a full Language, Compiler and Hardware stack
Shawn Hershey, Jeff Bernstein, Bill Bradley +4
We introduce Dimple, a fully open-source API for probabilistic modeling. Dimple allows the user to specify probabilistic models in the form of graphical models, Bayesian networks,…
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…