Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
Daniel Thompson, Zachary T. Harmany, Roummel F. Ma...
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...