2069 search results - page 143 / 414 » Linear time algorithms for Clobber |
147
click to vote
PAIRING
2007
Springer
15 years 10 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
155
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
144
click to vote
ALENEX
2010
15 years 6 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
148
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
185
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...