2496 search results - page 34 / 500 » On covering by translates of a set |
AAI
2011
12 years 11 months ago
2011
We compare different strategies to apply statistical machine translation techniques in order to retrieve documents which are a plausible translation of a given source document. Fi...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, t...
TCS
2008
13 years 7 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
NIPS
2003
13 years 9 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...