9572 search results - page 322 / 1915 » Cover Algorithms and Their Combination |
166
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 ...
195
click to vote
HASE
2008
IEEE
16 years 1 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 ...
173
click to vote
ESWS
2007
Springer
16 years 26 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...
154
click to vote
ECCB
2005
IEEE
16 years 9 days 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...
225
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...