7796 search results - page 329 / 1560 » On Generalized Schur Numbers |
247
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
394
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
240
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
185
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
195
click to vote
SADM
2011
15 years 1 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...