Sciweavers

2996 search results - page 26 / 600
» Numberings and Randomness
Sort
View
ASIACRYPT
2001
Springer
14 years 2 months ago
The Modular Inversion Hidden Number Problem
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
Dan Boneh, Shai Halevi, Nick Howgrave-Graham
MOC
1998
106views more  MOC 1998»
13 years 9 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan
BMCBI
2007
154views more  BMCBI 2007»
13 years 10 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
RSA
2000
95views more  RSA 2000»
13 years 9 months ago
Distribution of the number of consecutive records
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
Hua-Huai Chern, Hsien-Kuei Hwang, Yeong-Nan Yeh
DM
2008
82views more  DM 2008»
13 years 9 months ago
The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
Elvan Ceyhan