This paper describes an approach to reformulating the stereo matching problem as a large scale Linear Program. The approach proceeds by approximating the match cost function associated with each pixel with a piecewise linear convex function. Regularization terms related to the first and second derivative of the disparity field are also captured with piecewise linear penalty terms. The resulting...

Creating a domain model (expert behavior) is a key component of every tutoring system. Whether the process is manual or semiautomatic, the construction of the rules of expert behavior requires substantial effort. Once finished, the domain model is treated as a fixed entity that does not change based on scope, sequence modifications, or student learning parameters. In this paper, we propose a fr...

Linear inverse Gaussian problems is traditionally solved using least squares based inversion. The center of the posterior Gaussian probability distribution is often chosen as the solution to such problems, while the solution is in fact the posterior Gaussian probability distribution itself. We present an algorithm, based on direct sequential simulation, which can be used to efficiently draw sam...

Any mathematical model, which can be written in the above for some parameters cj , bi and ai,j (where i ∈ {1, 2, . . . , m} and j ∈ {1, 2, . . . , n}) is called a Linear Program (often abrieviated LP). Observe that the WGC problem is a linear program with m = 3 (three resources) and n = 2 (two activities). In the following, we will talk about linear programs as a mathematical object. In other w...

We study the problem of finding a point in the relative interior of the optimal face of a linear program. We prove that in the worst case such a point can be obtained in O(n3L) arithmetic operations. This complexity is the same as the complexity for solving a linear program. We also show how to find such a point in practice. We report and discuss computational results obtained for the linear pr...

This paper synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by LAND AND DOIG and by ROY, BEBTIER, AND NGHIEM. The synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by GLOVBK. A simple implicit enumerat...

The Cell BE is among a new generation of multicore processors including the Intel Larrabee and the Tilera TILE64 that provide an impressive peak fixed or floating point performance for scientific, signal processing, visualization, and other engineering applications. As shown in Fig. 1, the Cell uses simple in-order cores designed specifically for numerical computing, and requires explicit memor...

It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their introduction is that the evaluation of a program might not terminate and checking whether it terminates or not is undecidable. To cope with this problem, several clas...