736 search results - page 25 / 148 » Algorithms for Ordinal Arithmetic |
136
Voted
COLT
2010
Springer
15 years 12 days ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
102
Voted
ESA
1999
Springer
15 years 6 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
102
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
124
click to vote
ARITH
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
114
click to vote
HPCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...