2766 search results - page 97 / 554 » Algorithms for trigonometric polynomials |
155
click to vote
ICPP
1996
IEEE
15 years 5 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
89
Voted
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
79
Voted
COLT
2004
Springer
15 years 6 months ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
108
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
107
click to vote
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...