Sciweavers

425 search results - page 27 / 85
» Polynomial Factorization 1987-1991
Sort
View
ICPP
1996
IEEE
14 years 3 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
STACS
1989
Springer
14 years 2 months ago
A Generalization of Automatic Sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jeffrey Shallit
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
14 years 6 days 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
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 5 months ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 4 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven