2766 search results - page 263 / 554 » Algorithms for trigonometric polynomials |
129
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
139
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
153
click to vote
APPROX
2009
Springer
16 years 5 days ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
169
click to vote
SARA
2009
Springer
16 years 3 days ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
147
click to vote
CISS
2008
IEEE
16 years 1 days ago
2008
IEEE
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...