Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
Cropping systems models have evolved over the last four decades in response to the demand for modeling to address more complex questions, including issues on sustainable productio...
Cheryl H. Porter, J. W. Jones, S. Adiku, A. J. Gij...
—The goal of this work is to develop statistical models for the shape change of a configuration of “landmark” points (key points of interest) over time and to use these mode...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...