In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...