7195 search results - page 604 / 1439 » On Computing Power |
208
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
173
click to vote
CAE
2005
15 years 9 months ago
2005
Labels effectively convey co-referential relations between textual and visual elements and are a powerful tool to support learning tasks. Therefore, almost all illustrations in sc...
177
click to vote
ESORICS
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret informati...
209
click to vote
ACL
2006
15 years 8 months ago
2006
This paper designs a novel lexical hub to disambiguate word sense, using both syntagmatic and paradigmatic relations of words. It only employs the semantic network of WordNet to c...
183
click to vote
FIMI
2003
15 years 8 months ago
2003
We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...