We propose a novel approach to optimizing unconstrained quadratic binary problems (QBP) and binary MRFs based on discrete, submodular majorization of the original problem that can be solved efficiently using graph cuts. This yields an efficient algorithm that is appropriate for quickly finding a good solution to general Quadratic Binary Problems. It first solves a majorizing function exactly to...

In this paper we propose a theoretical framework to analyze and assess the properties of overlay networks with the goal of studying problems related to rival resource sharing. We study optimality goals for the construction of such overlay networks and focus on fairness issues by defining perfectly reciprocal overlays, in which every peer receives exactly the same amount of resources it offers. ...

Linear elliptic problems in bounded domains are normally solvable with a finite-dimensional kernel and a finite codimension of the image, that is, satisfy the Fredholm property, if the ellipticity condition, the condition of proper ellipticity and the Lopatinskii condition are satisfied. In the case of unbounded domains these conditions are not sufficient any more. The necessary and sufficient ...

We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets Si of V , a feasible solution is a partition of V such that each subset of the partition is included in one of the Si. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p,...

Several general techniques on linear preserver problems are described. The first one is based on a transfer principle in Model Theoretic Algebra that allows one to extend linear preserver results on complex matrices to matrices over other algebraically closed fields of characteristic 0. The second one concerns the use of some simple geometric technique to reduce linear preserver problems to sta...

The well-known travelling salesman problem can be expressed in graphtheoretic terms as follows : find a minimum-weight Hamiltonian cycle in a connected edge-weighted graph G(N, A). vVe concentrate here on the problem where G is large and sparse, i.e., where INI is 500 or more and IAI is O( INI). Such graphs arise frequently in practice, where G represents a road network, and each node (city) is...

We describe a parallel implementation of a genetic-linkage analysis program that achieves good speed improvement, even for analyses on a single pedigree and with a single starting recombination fraction vector. Our parallel implementation has been run on three different platforms: an Ethernet network of workstations, a higher-bandwidth asynchronous transfer mode (ATM) network of workstations, a...

BACKGROUND Dentistry is a small component of the undergraduate medical curriculum, however many patients with oral disease seek advice from their doctor. Problems include dental pain, abscesses, avulsed teeth and fractured jaws. Some patients associate the concept of dental treatment with negative emotions (ie. fear), and doctors are generally seen as caring professionals who might provide reas...

In this paper, we study the dual representation for generalized multiple stopping problems, hence the pricing problem of general multiple exercise options. We derive a dual representation which allows for cashflows which are subject to volume constraints modeled by integer valued adapted processes and refraction periods modeled by stopping times. As such, this extends the works by Schoenmakers ...

This paper deals with a general mixed integer knapsack polyhedron for which we introduce and analyze a new family of inequalities. We discuss the value of this family both from a theoretic and a computational point of view.