2766 search results - page 128 / 554 » Algorithms for trigonometric polynomials |
124
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
154
click to vote
ANTS
2010
Springer
15 years 7 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
133
Voted
WINE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
139
click to vote
TON
2008
15 years 3 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
151
click to vote
ICC
2011
IEEE
14 years 3 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...