471 search results - page 24 / 95 » Faster Multiplication in GF(2)[x] |
98
Voted
CASC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
100
Voted
AMEC
2003
Springer
15 years 5 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
106
Voted
JCO
2000
15 years 12 days ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
DCC
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
103
click to vote
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
-1 The couplings via realistic lossy substrates can be modeled as frequency-dependent coupling parameters. The fast extraction at multiple frequencies can be accomplished in two se...