861 search results - page 36 / 173 » Faster integer multiplication |
COMBINATORICS
1998
14 years 9 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
ACMSE
2006
ACM
15 years 1 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
121
click to vote
CP
2003
Springer
15 years 3 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
ICISC
2009
14 years 7 months ago
2009
Abstract. The design of embedded processors demands a careful tradeoff between many conflicting objectives such as performance, silicon area and power consumption. Finding such a t...