451 search results - page 31 / 91 » Some Lower Bounds on Geometric Separability Problems |
UAI
2003
14 years 11 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
107
Voted
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
106
click to vote
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
98
Voted
EJC
2008
14 years 9 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
102
click to vote
ALGORITHMICA
2006
14 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...