2766 search results - page 108 / 554 » Algorithms for trigonometric polynomials |
113
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
131
click to vote
NIPS
2003
15 years 5 months ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
123
click to vote
MOR
2006
15 years 3 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
150
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
127
Voted
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...