2496 search results - page 190 / 500 » On covering by translates of a set |
165
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
181
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
174
click to vote
TOOLS
2008
IEEE
16 years 29 days ago
2008
IEEE
Abstract. Many real-time systems use runtime structural reconfiguration mechanisms based on dynamic creation and destruction of components. To support such features, UML-RT provid...
169
click to vote
ESWS
2007
Springer
16 years 23 days ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
142
click to vote
WADS
2007
Springer
16 years 21 days ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...