604 search results - page 79 / 121 » On the Complexity of the Maximum Cut Problem |
ALGORITHMICA
2002
14 years 9 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
JACM
1998
14 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
101
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We derive a novel method to determine the parameters for regularized super-resolution problems. The proposed approach relies on the Joint Maximum a Posteriori (JMAP) estimation te...