Sciweavers

649 search results - page 24 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
75
Voted
MFCS
2004
Springer
15 years 3 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
78
Voted
LPNMR
2007
Springer
15 years 4 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
ECCV
2010
Springer
15 years 3 months ago
Enhancing Interactive Image Segmentation with Automatic Label Set Augmentation
Abstract. We address the problem of having insufficient labels in an interactive image segmentation framework, for which most current methods would fail without further user inter...
HEURISTICS
2010
14 years 7 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...