2766 search results - page 461 / 554 » Algorithms for trigonometric polynomials |
128
click to vote
CIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
128
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
129
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
130
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
144
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...