Sciweavers

2496 search results - page 4 / 500
» On covering by translates of a set
Sort
View
COR
2006
122views more  COR 2006»
13 years 7 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
FOCS
2009
IEEE
14 years 2 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
ACL
2010
13 years 5 months ago
Tools for Multilingual Grammar-Based Translation on the Web
This is a system demo for a set of tools for translating texts between multiple languages in real time with high quality. The translation works on restricted languages, and is bas...
Aarne Ranta, Krasimir Angelov, Thomas Hallgren
ACL
1998
13 years 8 months ago
Ambiguity Preserving Machine Translation using Packed Representations
In this paper we present an ambiguity preserving translation approach which transfers ambiguous LFG f-structure representations. It is based on packed f-structure representations ...
Martin C. Emele, Michael Dorna
COLING
2010
13 years 2 months ago
A Monolingual Tree-based Translation Model for Sentence Simplification
In this paper, we consider sentence simplification as a special form of translation with the complex sentence as the source and the simple sentence as the target. We propose a Tre...
Zhemin Zhu, Delphine Bernhard, Iryna Gurevych