Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brou...

Rank minimization has attracted a lot of attention due to its robustness in data recovery. To overcome the computational difficulty, rank is often replaced with nuclear norm. For several rank minimization problems, such a replacement has been theoretically proven to be valid, i.e., the solution to nuclear norm minimization problem is also the solution to rank minimization problem. Although it i...

In this paper, optimal distributed control of the time-dependent Navier-Stokes equations is considered. The control problem involves the minimization of a measure of the distance between the velocity field and a given target velocity field. A mixed numerical method involving a quasi-Newton algorithm, a novel calculation of the gradients and an inhomogeneous Navier-Stokes solver, to find the opt...

Today, the development of a modern video game draws upon multiple areas expertise. Moreover, its cost could be as high tens millions dollars. Consequently, we should carefully schedule jobs so not to increase total cost. However, project leaders traditionally treat developers alike or even all manually. In this study, consider versatile-developer scheduling problem. The objective is minimize ma...