358 search results - page 19 / 72 » GCD of Many Integers |
143
click to vote
IMA
2009
Springer
15 years 10 months ago
2009
Springer
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
118
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
164
Voted
FAW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
120
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
121
click to vote
INDOCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av2 n...