53 search results - page 10 / 11 » latin 2010 |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the last years an increasing demand for Grid Infrastructures has result edin several international collaborations. This is the case of the EELA Project, which has brought togeth...
LATIN
2010
Springer
13 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
LATIN
2010
Springer
14 years 23 hour ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
LREC
2010
13 years 6 months ago
2010
In this paper, we present a simple protocol to evaluate word aligners on bilingual lexicon induction tasks from parallel corpora. Rather than resorting to gold standards, it relie...