Sciweavers

4403 search results - page 8 / 881
» Galois Theory of Algorithms
Sort
View
PQCRYPTO
2010
142views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Growth of the Ideal Generated by a Quadratic Boolean Function
We give exact formulas for the growth of the ideal Aλ for λ a quadratic element of the algebra of Boolean functions over the Galois field GF(2). That is, we calculate dim Akλ w...
Jintai Ding, Timothy J. Hodges, Victoria Kruglov
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 7 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
PPOPP
2010
ACM
14 years 4 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
FFA
2010
70views more  FFA 2010»
13 years 4 months ago
Fast arithmetic in unramified p-adic fields
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
Hendrik Hubrechts
ASIACRYPT
1999
Springer
13 years 11 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...