358 search results - page 15 / 72 » GCD of Many Integers |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
CP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
ISSAC
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...