2766 search results - page 69 / 554 » Algorithms for trigonometric polynomials |
149
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
113
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
142
Voted
CCCG
1998
15 years 5 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
106
Voted
AAECC
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
128
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...