activity
20092019
most citedApproximating the Permanent with Fractional Belief Propagation

22 citations · 41 across the 4 of their papers we have counts for

collaborators

8 papers

cs.CV2019★ 14 cited

Computational Mirrors: Blind Inverse Light Transport by Deep Matrix Factorization

Miika Aittala, Prafull Sharma, Lukas Murmann +4

We recover a video of the motion taking place in a hidden scene by observing changes in indirect illumination in a nearby uncalibrated visible region. We solve this problem by fact…

cs.CC2019

Faster Random -CNF Satisfiability

Andrea Lincoln, Adam Yedidia

We describe an algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly. We build upon the algorithms of Sch{ö}ning 1999 and Dantsin e…

eess.IV2018

Near-Optimal Coded Apertures for Imaging via Nazarov's Theorem

Ganesh Ajjanagadde, Christos Thrampoulidis, Adam Yedidia +1

We characterize the fundamental limits of coded aperture imaging systems up to universal constants by drawing upon a theorem of Nazarov regarding Fourier transforms. Our work is pe…

math.CO2018★ 1 cited

Computation of Maximal Determinants of Binary Circulant Matrices

Richard P. Brent, Adam B. Yedidia

We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from …

eess.IV2017

Analysis and Optimization of Aperture Design in Computational Imaging

Adam Yedidia, Christos Thrampoulidis, Gregory Wornell

There is growing interest in the use of coded aperture imaging systems for a variety of applications. Using an analysis framework based on mutual information, we examine the fundam…

cs.FL2016

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory

Adam Yedidia, Scott Aaronson

Since the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of ZFC set theory. Is…