7342 search results - page 967 / 1469 » Optimal Language Learning |
142
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
161
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
137
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
166
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
163
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...