2496 search results - page 141 / 500 » On covering by translates of a set |
156
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
172
click to vote
IPL
2002
15 years 6 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
176
click to vote
NAACL
2010
15 years 4 months ago
2010
Producing a fluent ordering for a set of prenominal modifiers in a noun phrase (NP) is a problematic task for natural language generation and machine translation systems. We prese...
185
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
179
click to vote
NDSS
2009
IEEE
16 years 1 months ago
2009
IEEE
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...