471 search results - page 10 / 95 » Faster Multiplication in GF(2)[x] |
WDAG
1995
Springer
15 years 2 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
ECCC
2006
14 years 11 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
104
click to vote
DCC
2000
IEEE
14 years 11 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
99
Voted
JCC
2006
14 years 11 months ago
2006
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
EDM
2008
15 years 16 days ago
2008
We present text replays, a method for generating labels that can be used to train classifiers of student behavior. We use this method to label data as to whether students are gamin...