2766 search results - page 165 / 554 » Algorithms for trigonometric polynomials |
172
click to vote
CCCG
2007
15 years 7 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
160
click to vote
ENDM
2008
15 years 6 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
145
click to vote
JCAM
2010
15 years 1 months ago
2010
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
194
click to vote
TOC
2010
15 years 1 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...