Sciweavers

2766 search results - page 137 / 554
» Algorithms for trigonometric polynomials
Sort
View
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
15 years 5 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon
DAGSTUHL
2007
15 years 5 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
ACL
2003
15 years 5 months ago
Loosely Tree-Based Alignment for Machine Translation
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
Daniel Gildea
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 4 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
MOC
2002
112views more  MOC 2002»
15 years 3 months ago
Approximation of the Hilbert Transform on the real line using Hermite zeros
The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform...
M. C. De Bonis, Biancamaria Della Vecchia, Giusepp...