Sciweavers

39 search results - page 3 / 8
» Evasiveness and the Distribution of Prime Numbers
Sort
View
MOC
2000
71views more  MOC 2000»
13 years 7 months ago
Zeroes of Dirichlet L-functions and irregularities in the distribution of primes
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
Carter Bays, Richard H. Hudson
AINA
2007
IEEE
14 years 1 months ago
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
Peter Lory
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 12 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 7 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
EM
2010
154views Management» more  EM 2010»
13 years 2 months ago
Chebyshev's Bias for Products of Two Primes
Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers x that are in a given arithmetic progression modulo q and the...
Kevin Ford, Jason Sneed