828 search results - page 80 / 166 » Bounded Hairpin Completion |
92
Voted
TCS
2008
15 years 18 days ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
111
click to vote
PAMI
2007
15 years 5 days ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
92
Voted
JSYML
2008
14 years 11 months ago
2008
Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say...
128
Voted
COR
2011
14 years 7 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
80
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...