1486 search results - page 160 / 298 » Algorithms for two-box covering |
151
click to vote
PETRA
2009
ACM
15 years 11 months ago
2009
ACM
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
133
click to vote
FOCS
2008
IEEE
15 years 11 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 ...
155
click to vote
HASE
2008
IEEE
15 years 11 months ago
2008
IEEE
Web applications often use dynamic pages that interact with each other by accessing shared objects, e.g., session objects. Interactions between dynamic pages need to be carefully ...
140
click to vote
ESWS
2007
Springer
15 years 10 months 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...
124
click to vote
ECCB
2005
IEEE
15 years 10 months ago
2005
IEEE
Similarity Matrix of Proteins (SIMAP) (http://mips.gsf. 10 de/simap) provides a database based on a precomputed similarity matrix covering the similarity space formed by .4 millio...