We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
Daniel Orozco, Liping Xue, Murat Bolat, Xiaoming L...
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
We present a new approach to iteratively estimate both
high-quality depth map and alpha matte from a single image
or a video sequence. Scene depth, which is invariant
to illumin...
Jiejie Zhu (University of Kentucky), Miao Liao (Un...
We present a new approach for the discriminative training
of continuous-valued Markov Random Field (MRF)
model parameters. In our approach we train the MRF
model by optimizing t...